On the public citation graph

Fast balanced augmented Lagrangian method for a linearly constrained convex optimization problem

0 signed · 26 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00927673openalex-snapshot
Multiplier and gradient methods
inferredcites →https://doi.org/10.1007/s10107-016-0992-8openalex-snapshot
Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
inferredcites →https://doi.org/10.1007/s10107-018-1284-2openalex-snapshot
A simplified view of first order methods for optimization
inferredcites →https://doi.org/10.1007/s10107-022-01879-4openalex-snapshot
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates
inferredcites →https://doi.org/10.1007/s10208-013-9150-3openalex-snapshot
Adaptive Restart for Accelerated Gradient Schemes
inferredcites →https://doi.org/10.1007/s10851-010-0251-1openalex-snapshot
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
inferredcites →https://doi.org/10.1007/s10915-013-9686-zopenalex-snapshot
Accelerated Bregman Method for Linearly Constrained $$\ell _1$$ – $$\ell _2$$ Minimization
inferredcites →https://doi.org/10.1007/s10915-021-01452-9openalex-snapshot
A Golden Ratio Primal–Dual Algorithm for Structured Convex Optimization
inferredcites →https://doi.org/10.1007/s11075-021-01246-yopenalex-snapshot
Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems
inferredcites →https://doi.org/10.1007/s11075-024-01796-xopenalex-snapshot
$$O(1/k^2)$$ convergence rates of (dual-primal) balanced augmented Lagrangian methods for linearly constrained convex programming
inferredcites →https://doi.org/10.1007/s11075-024-01974-xopenalex-snapshot
A splitting preconditioned primal-dual algorithm with interpolation and extrapolation for bilinear saddle point problem
inferredcites →https://doi.org/10.1007/s11075-025-02010-2openalex-snapshot
Fast primal-dual algorithm with Tikhonov regularization for a linear equality constrained convex optimization problem
inferredcites →https://doi.org/10.1007/s11766-017-3381-zopenalex-snapshot
An accelerated augmented Lagrangian method for linearly constrained convex programming with the rate of convergence O(1/k 2)
inferredcites →https://doi.org/10.1007/s12190-022-01779-yopenalex-snapshot
A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming
inferredcites →https://doi.org/10.1016/j.automatica.2012.08.018openalex-snapshot
Randomized optimal consensus of multi-agent systems
inferredcites →https://doi.org/10.1090/s0025-5718-2012-02598-1openalex-snapshot
Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
inferredcites →https://doi.org/10.1093/imanum/dry092openalex-snapshot
Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
inferredcites →https://doi.org/10.1109/twc.2006.1687734openalex-snapshot
Distributed algorithms for maximum lifetime routing in wireless sensor networks
inferredcites →https://doi.org/10.1137/080716542openalex-snapshot
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
inferredcites →https://doi.org/10.1137/090777761openalex-snapshot
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
inferredcites →https://doi.org/10.1137/120896219openalex-snapshot
Fast Alternating Direction Optimization Methods
inferredcites →https://doi.org/10.1137/16m1082305openalex-snapshot
Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming
inferredcites →https://doi.org/10.1137/17m1118609openalex-snapshot
Distributed Continuous-Time Algorithms for Nonsmooth Extended Monotropic Optimization Problems
inferredcites →https://doi.org/10.1137/21m1420319openalex-snapshot
Golden Ratio Primal-Dual Algorithm with Linesearch
inferredcites →https://doi.org/10.1287/moor.1.2.97openalex-snapshot
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
inferredcites →https://doi.org/10.1561/2200000016openalex-snapshot
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
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.