On the public citation graph
Alternating direction splitting for block Angular parallel optimization
0 signed · 48 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800030109openalex-snapshot
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1002/net.3230080107openalex-snapshot
Multicommodity network flows—A survey
inferredcites →https://doi.org/10.1002/net.3230210603openalex-snapshot
Solving multistage stochastic networks: An application of scenario aggregation
inferredcites →https://doi.org/10.1007/978-1-4419-7729-8openalex-snapshot
Stochastic Linear Programming
inferredcites →https://doi.org/10.1007/bf00247655openalex-snapshot
Application of the alternating direction method of multipliers to separable convex programming problems
inferredcites →https://doi.org/10.1007/bf00934960openalex-snapshot
On the method of multipliers for mathematical programming problems
inferredcites →https://doi.org/10.1007/bf01581204openalex-snapshot
On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators
inferredcites →https://doi.org/10.1007/bf01589410openalex-snapshot
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
inferredcites →https://doi.org/10.1016/0005-1098(76)90077-7openalex-snapshot
Multiplier methods: A survey
inferredcites →https://doi.org/10.1016/0167-6377(92)90046-6openalex-snapshot
A diagonal quadratic approximation method for large scale linear programs
inferredcites →https://doi.org/10.1016/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1016/s0168-2024(08)70028-6openalex-snapshot
Chapter III On Decomposition-Coordination Methods Using an Augmented Lagrangian
inferredcites →https://doi.org/10.1016/s0168-2024(08)x7003-1openalex-snapshot
Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems
inferredcites →https://doi.org/10.1016/s1570-8659(05)80035-3openalex-snapshot
Splitting and alternating direction methods
inferredcites →https://doi.org/10.1090/s0002-9947-1956-0084194-4openalex-snapshot
On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
inferredcites →https://doi.org/10.1137/0103003openalex-snapshot
The Numerical Solution of Parabolic and Elliptic Differential Equations
inferredcites →https://doi.org/10.1137/0716071openalex-snapshot
Splitting Algorithms for the Sum of Two Nonlinear Operators
inferredcites →https://doi.org/10.1137/0801035openalex-snapshot
An Interior Point Method for Block Angular Optimization
inferredcites →https://doi.org/10.1137/0804045openalex-snapshot
Coordination in Coarse-Grained Decomposition
inferredcites →https://doi.org/10.1137/1.9780898719000openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1287/ijoc.5.1.84openalex-snapshot
The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
inferredcites →https://doi.org/10.1287/moor.16.1.119openalex-snapshot
Scenarios and Policy Aggregation in Optimization Under Uncertainty
inferredcites →https://doi.org/10.1287/opre.8.1.101openalex-snapshot
Decomposition Principle for Linear Programs
inferredcites →https://doi.org/10.2307/2153048openalex-snapshot
Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44942-6_25openalex-snapshot
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows
inferred← citeshttps://doi.org/10.1007/978-1-4899-0289-4_4openalex-snapshot
Massively Parallel Solution of Large Scale Network Flow Problems
inferred← citeshttps://doi.org/10.1007/bf02680549openalex-snapshot
A variable-penalty alternating directions method for convex optimization
inferred← citeshttps://doi.org/10.1007/s10589-012-9515-6openalex-snapshot
Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
inferred← citeshttps://doi.org/10.1007/s10957-009-9566-8openalex-snapshot
Interior-Point Lagrangian Decomposition Method for Separable Convex Optimization
inferred← citeshttps://doi.org/10.1016/j.jprocont.2010.12.010openalex-snapshot
Parallel and distributed optimization methods for estimation and control in networks
inferred← citeshttps://doi.org/10.1023/a:1016727300010openalex-snapshot
A Parallel Optimization Approach to ATM Network Survivability
inferred← citeshttps://doi.org/10.1080/02331934.2011.611883openalex-snapshot
An alternating direction method for solving convex nonlinear semidefinite programming problems
inferred← citeshttps://doi.org/10.1080/02331934.2015.1044898openalex-snapshot
Fast inexact decomposition algorithms for large-scale separable convex optimization
inferred← citeshttps://doi.org/10.1109/cdc.2008.4738764openalex-snapshot
A proximal center-based decomposition method for multi-agent convex optimization
inferred← citeshttps://doi.org/10.1109/tac.2008.2007159openalex-snapshot
Application of a Smoothing Technique to Decomposition in Convex Optimization
inferred← citeshttps://doi.org/10.1109/tsp.2009.2039825openalex-snapshot
Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management
inferred← citeshttps://doi.org/10.1109/tsp.2015.2437846openalex-snapshot
A Parallel Low Complexity Zero-Forcing Beamformer Design for Multiuser MIMO Systems Via a Regularized Dual Decomposition Method
inferred← citeshttps://doi.org/10.1137/s1052623495288064openalex-snapshot
Proximal Decomposition Via Alternating Linearization
inferred← citeshttps://doi.org/10.1287/ijoc.15.4.369.24887openalex-snapshot
Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0048openalex-snapshot
Semi-proximal Augmented Lagrangian-Based Decomposition Methods for Primal Block-Angular Convex Composite Quadratic Conic Programming Problems
inferred← citeshttps://doi.org/10.23919/ecc.2009.7074530openalex-snapshot
A dual interior-point distributed algorithm for large-scale data networks optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1105.5427openalex-snapshot
Combining Lagrangian Decomposition and Excessive Gap Smoothing Technique for Solving Large-Scale Separable Convex Optimization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1212.4275openalex-snapshot
Fast Inexact Decomposition Algorithms For Large-Scale Separable Convex Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1302.3136openalex-snapshot
An Interior-Point Lagrangian Decomposition Method for Separable Convex Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1812.04941openalex-snapshot
A semi-proximal augmented Lagrangian based decomposition method for primal block angular convex composite quadratic conic programming problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.