On the public citation graph
Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
0 signed · 53 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.1007/bf00932905openalex-snapshot
On the convergence properties of second-order multiplier methods
inferredcites →https://doi.org/10.1007/bf00934777openalex-snapshot
The multiplier method of Hestenes and Powell applied to convex programming
inferredcites →https://doi.org/10.1007/bf01580123openalex-snapshot
A general saddle point result for constrained optimization
inferredcites →https://doi.org/10.1007/bf01876941openalex-snapshot
Approximation of the classical isoperimetric problem
inferredcites →https://doi.org/10.1007/bfb0120836openalex-snapshot
Point-to-Set Maps and Mathematical Programming
inferredcites →https://doi.org/10.1016/0041-5553(71)90094-2openalex-snapshot
The convergence rate of the penalty function method
inferredcites →https://doi.org/10.1016/0041-5553(74)90004-4openalex-snapshot
The method of penalty estimates for conditional extremum problems
inferredcites →https://doi.org/10.1016/b978-0-12-468650-2.50011-0openalex-snapshot
RATE OF CONVERGENCE OF THE METHOD OF MULTIPLIERS WITH INEXACT MINIMIZATION
inferredcites →https://doi.org/10.1016/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1093/comjnl/13.2.178openalex-snapshot
A new method for the optimization of a nonlinear function subject to nonlinear constraints
inferredcites →https://doi.org/10.1109/cdc.1973.269172openalex-snapshot
Convergence rate of penalty and multiplier methods
inferredcites →https://doi.org/10.1109/tac.1974.1100535openalex-snapshot
Introduction to linear and nonlinear programming
inferredcites →https://doi.org/10.1137/0312021openalex-snapshot
Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
inferredcites →https://doi.org/10.1137/0313045openalex-snapshot
Unconstrained Lagrangians in Nonlinear Programming
inferredcites →https://doi.org/10.1137/0314017openalex-snapshot
On Penalty and Multiplier Methods for Constrained Minimization
inferredcites →https://doi.org/10.2307/1910003openalex-snapshot
Studies in Linear and Nonlinear Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10107-007-0105-9openalex-snapshot
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-018-1261-9openalex-snapshot
Improved local convergence results for augmented Lagrangian methods in $${\varvec{C}}^\mathbf{2}$$C2-cone reducible constrained optimization
inferred← citeshttps://doi.org/10.1007/s10107-018-1300-6openalex-snapshot
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
inferred← citeshttps://doi.org/10.1007/s10107-022-01843-2openalex-snapshot
The augmented Lagrangian method can approximately solve convex optimization with least constraint violation
inferred← citeshttps://doi.org/10.1007/s10589-012-9502-yopenalex-snapshot
An inexact restoration strategy for the globalization of the sSQP method
inferred← citeshttps://doi.org/10.1007/s10589-023-00520-0openalex-snapshot
Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10957-008-9390-6openalex-snapshot
Convergence of the Augmented Lagrangian Method for Nonlinear Optimization Problems over Second-Order Cones
inferred← citeshttps://doi.org/10.1007/s10957-009-9598-0openalex-snapshot
Separation Approach for Augmented Lagrangians in Constrained Nonconvex Optimization
inferred← citeshttps://doi.org/10.1007/s10957-015-0842-5openalex-snapshot
On the Convergence Properties of a Second-Order Augmented Lagrangian Method for Nonlinear Programming Problems with Inequality Constraints
inferred← citeshttps://doi.org/10.1007/s10957-021-01914-yopenalex-snapshot
Perturbed Augmented Lagrangian Method Framework with Applications to Proximal and Smoothed Variants
inferred← citeshttps://doi.org/10.1007/s11075-024-01912-xopenalex-snapshot
Convergence analysis of the augmented Lagrangian method for $$\ell _{p}$$-norm cone optimization problems with $$p \ge 2$$
inferred← citeshttps://doi.org/10.1007/s11425-021-1920-5openalex-snapshot
Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
inferred← citeshttps://doi.org/10.1007/s11590-019-01449-2openalex-snapshot
The rate of convergence of proximal method of multipliers for equality constrained optimization problems
inferred← citeshttps://doi.org/10.1007/s40305-021-00346-9openalex-snapshot
Augmented Lagrangian Methods for Convex Matrix Optimization Problems
inferred← citeshttps://doi.org/10.1007/s40305-022-00439-zopenalex-snapshot
The Rate of Convergence of Augmented Lagrangian Method for Minimax Optimization Problems with Equality Constraints
inferred← citeshttps://doi.org/10.1007/s40305-025-00643-7openalex-snapshot
A Survey on Some Recent Advances in Linear and Nonlinear Second-Order Cone Programming
inferred← citeshttps://doi.org/10.1007/s40305-026-00713-4openalex-snapshot
The Analysis of the Rate of Local Convergence of the Augmented Lagrangian Method for Minimax Optimization Problems with Inequality Constraints
inferred← citeshttps://doi.org/10.1016/j.amc.2008.10.015openalex-snapshot
The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
inferred← citeshttps://doi.org/10.1016/j.na.2006.12.016openalex-snapshot
On the approximate augmented Lagrangian for nonlinear symmetric cone programming
inferred← citeshttps://doi.org/10.1080/02331934.2019.1647200openalex-snapshot
The rate of convergence of proximal method of multipliers for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1080/02331934.2022.2086055openalex-snapshot
Study on convex optimization with least constraint violation under a general measure
inferred← citeshttps://doi.org/10.1080/02331934.2024.2375425openalex-snapshot
Local convergence of augmented Lagrangian methods for composite optimization
inferred← citeshttps://doi.org/10.1080/02331934.2025.2535423openalex-snapshot
Analysis about the rate of convergence of the augmented Lagrange method for the nonlinear semidefinite nuclear norm composite optimization problem*
inferred← citeshttps://doi.org/10.1080/10556780802124648openalex-snapshot
Convergence properties of augmented Lagrangian methods for constrained global optimization
inferred← citeshttps://doi.org/10.1080/10556788.2013.841692openalex-snapshot
On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
inferred← citeshttps://doi.org/10.1080/10556788.2020.1738435openalex-snapshot
The rate of convergence of proximal method of multipliers for nonlinear programming
inferred← citeshttps://doi.org/10.1109/tcomm.2016.2535371openalex-snapshot
How to Increase Energy Efficiency in Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1137/10081085xopenalex-snapshot
Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
inferred← citeshttps://doi.org/10.1137/22m1530161openalex-snapshot
Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
inferred← citeshttps://doi.org/10.1142/s0217595915500128openalex-snapshot
The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity
inferred← citeshttps://doi.org/10.1142/s0217595920400011openalex-snapshot
The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion
inferred← citeshttps://doi.org/10.1287/moor.27.1.170.331openalex-snapshot
Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
inferred← citeshttps://doi.org/10.3390/math13121946openalex-snapshot
Characterization of the Convergence Rate of the Augmented Lagrange for the Nonlinear Semidefinite Optimization Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1706.08800openalex-snapshot
On the R-superlinear convergence of the KKT residues generated by the augmented Lagrangian method for convex composite conic programming
inferred← citeshttps://doi.org/10.48550/arxiv.1709.00559openalex-snapshot
The Rate of Convergence of the Augmented Lagrangian Method for a Nonlinear Semidefinite Nuclear Norm Composite Optimization Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1910.06937openalex-snapshot
On the Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion
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.