On the public citation graph

An example comparing the standard and safeguarded augmented Lagrangian methods

https://doi.org/10.1016/j.orl.2017.09.005
0 signed · 59 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/b98874openalex-snapshot
Numerical Optimization
inferredcites →https://doi.org/10.1007/bf00927673openalex-snapshot
Multiplier and gradient methods
inferredcites →https://doi.org/10.1007/s10107-006-0077-1openalex-snapshot
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
inferredcites →https://doi.org/10.1007/s10107-009-0264-yopenalex-snapshot
Global minimization using an Augmented Lagrangian method with variable lower-level constraints
inferredcites →https://doi.org/10.1007/s10287-004-0010-0openalex-snapshot
Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
inferredcites →https://doi.org/10.1007/s10287-009-0093-8openalex-snapshot
Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
inferredcites →https://doi.org/10.1007/s10589-005-1066-7openalex-snapshot
Numerical Comparison of Augmented Lagrangian Algorithms for Nonconvex Problems
inferredcites →https://doi.org/10.1007/s10589-014-9685-5openalex-snapshot
Optimality properties of an Augmented Lagrangian method on infeasible problems
inferredcites →https://doi.org/10.1007/s10589-017-9963-0openalex-snapshot
Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
inferredcites →https://doi.org/10.1016/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1137/0312021openalex-snapshot
Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
inferredcites →https://doi.org/10.1137/060654797openalex-snapshot
On Augmented Lagrangian Methods with General Lower-Level Constraints
inferredcites →https://doi.org/10.1137/0728030openalex-snapshot
A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
inferredcites →https://doi.org/10.1137/1.9781611973365openalex-snapshot
Practical Augmented Lagrangian Methods for Constrained Optimization
inferredcites →https://doi.org/10.1137/110843939openalex-snapshot
Two New Weak Constraint Qualifications and Applications
inferredcites →https://doi.org/10.1137/16m1068256openalex-snapshot
Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4668409openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-79393-7_10openalex-snapshot
Safeguarded Augmented Lagrangian Methods in Banach Spaces
inferred← citeshttps://doi.org/10.1007/s00245-019-09564-3openalex-snapshot
Simple Algorithms for Optimization on Riemannian Manifolds with Constraints
inferred← citeshttps://doi.org/10.1007/s10107-022-01870-zopenalex-snapshot
An augmented Lagrangian method for optimization problems with structured geometric constraints
inferred← citeshttps://doi.org/10.1007/s10107-024-02163-3openalex-snapshot
A first-order augmented Lagrangian method for constrained minimax optimization
inferred← citeshttps://doi.org/10.1007/s10589-017-9937-2openalex-snapshot
Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
inferred← citeshttps://doi.org/10.1007/s10589-017-9963-0openalex-snapshot
Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
inferred← citeshttps://doi.org/10.1007/s10589-019-00161-2openalex-snapshot
Towards an efficient augmented Lagrangian method for convex quadratic programming
inferred← citeshttps://doi.org/10.1007/s10589-020-00204-zopenalex-snapshot
An augmented Lagrangian algorithm for multi-objective optimization
inferred← citeshttps://doi.org/10.1007/s10589-020-00223-wopenalex-snapshot
A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems
inferred← citeshttps://doi.org/10.1007/s10589-023-00475-2openalex-snapshot
Inexact penalty decomposition methods for optimization problems with geometric constraints
inferred← citeshttps://doi.org/10.1007/s10589-024-00572-wopenalex-snapshot
Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems
inferred← citeshttps://doi.org/10.1007/s10589-024-00603-6openalex-snapshot
A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
inferred← citeshttps://doi.org/10.1007/s10957-021-01854-7openalex-snapshot
An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-025-02734-0openalex-snapshot
On the Global Convergence of a General Class of Augmented Lagrangian Methods
inferred← citeshttps://doi.org/10.1007/s11075-021-01212-8openalex-snapshot
On the best achievable quality of limit points of augmented Lagrangian schemes
inferred← citeshttps://doi.org/10.1007/s11081-022-09747-yopenalex-snapshot
Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
inferred← citeshttps://doi.org/10.1016/j.ejco.2021.100008openalex-snapshot
Pareto front approximation through a multi-objective augmented Lagrangian method
inferred← citeshttps://doi.org/10.1016/j.orl.2019.03.006openalex-snapshot
On the convergence of inexact augmented Lagrangian methods for problems with convex constraints
inferred← citeshttps://doi.org/10.1016/j.rico.2024.100429openalex-snapshot
A constraint qualification for the dislocation hyperbolic augmented Lagrangian algorithm
inferred← citeshttps://doi.org/10.1051/cocv/2022024openalex-snapshot
Optimality conditions, approximate stationarity, and applications – a story beyond lipschitzness
inferred← citeshttps://doi.org/10.1051/ro/2023153openalex-snapshot
Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
inferred← citeshttps://doi.org/10.1080/02331934.2017.1349127openalex-snapshot
A generalized proximal-point method for convex optimization problems in Hilbert spaces
inferred← citeshttps://doi.org/10.1080/10556788.2020.1746962openalex-snapshot
Complexity and performance of an Augmented Lagrangian algorithm
inferred← citeshttps://doi.org/10.1080/10556788.2025.2612350openalex-snapshot
A first-order method for nonconvex-strongly-concave constrained minimax optimization
inferred← citeshttps://doi.org/10.1080/10556788.2026.2682934openalex-snapshot
KKT-free constrained optimization and application to river-Flow modelling
inferred← citeshttps://doi.org/10.1093/imanum/drab021openalex-snapshot
On the convergence of augmented Lagrangian strategies for nonlinear programming
inferred← citeshttps://doi.org/10.1093/imanum/drag043openalex-snapshot
Smoothing ℓ1-exact penalty method for intrinsically constrained Riemannian optimization problems
inferred← citeshttps://doi.org/10.11121/ijocta.1402openalex-snapshot
Dislocation hyperbolic augmented Lagrangian algorithm in convex programming
inferred← citeshttps://doi.org/10.1137/17m114114xopenalex-snapshot
The Multiplier-Penalty Method for Generalized Nash Equilibrium Problems in Banach Spaces
inferred← citeshttps://doi.org/10.1137/17m1146518openalex-snapshot
On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces
inferred← citeshttps://doi.org/10.1137/18m1230475openalex-snapshot
Quasi-Variational Inequalities in Banach Spaces: Theory and Augmented Lagrangian Methods
inferred← citeshttps://doi.org/10.1137/19m1306804openalex-snapshot
New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions
inferred← citeshttps://doi.org/10.1137/22m1489824openalex-snapshot
A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
inferred← citeshttps://doi.org/10.1137/24m1629237openalex-snapshot
A Relaxed Quasinormality Condition and the Boundedness of Dual Augmented Lagrangian Sequences
inferred← citeshttps://doi.org/10.1137/24m1692319openalex-snapshot
Global Convergence of an Augmented Lagrangian Method for Nonlinear Programming via Riemannian Optimization
inferred← citeshttps://doi.org/10.1155/2024/9615743openalex-snapshot
Inexact Exponential Penalty Function with the Augmented Lagrangian for Multiobjective Optimization Algorithms
inferred← citeshttps://doi.org/10.11606/t.45.2022.tde-30032022-212754openalex-snapshot
Topics in nonlinear conic optimization and applications
inferred← citeshttps://doi.org/10.1287/moor.2021.1165openalex-snapshot
A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods
inferred← citeshttps://doi.org/10.1287/moor.2021.1203openalex-snapshot
On Optimality Conditions for Nonlinear Conic Programming
inferred← citeshttps://doi.org/10.19139/soic-2310-5070-1875openalex-snapshot
Solving Multiobjective Optimization Problems with Inequality Constraint Using An Augmented Lagrangian Function
inferred← citeshttps://doi.org/10.21203/rs.3.rs-878309/v1openalex-snapshot
A New Sequential Optimality Condition of Cardinality-Constrained Optimization Problem and Application
inferred← citeshttps://doi.org/10.23919/acc45564.2020.9147892openalex-snapshot
Constrained and Sparse Switching Times Optimization via Augmented Lagrangian Proximal Methods
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.