Complexity and performance of an Augmented Lagrangian algorithm
From MaRDI portal
Publication:5858985
DOI10.1080/10556788.2020.1746962zbMath1464.90094arXiv1907.02401OpenAlexW2955809168WikidataQ122112884 ScholiaQ122112884MaRDI QIDQ5858985
Ernesto G. Birgin, José Mario Martínez
Publication date: 15 April 2021
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.02401
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization, On the complexity of solving feasibility problems with regularized models, An augmented Lagrangian method exploiting an active-set strategy and second-order information, Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints, A Shape-Newton Approach to the Problem of Covering with Identical Balls, A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods, Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem, A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees, A PDE-informed optimization algorithm for river flow predictions, Sensitivity analysis and tailored design of minimization diagrams, Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints, A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls, On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton's method may fail to recognize proximity to optimal points in constrained optimization
- A practical relative error criterion for augmented Lagrangians
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- An adaptive augmented Lagrangian method for large-scale constrained optimization
- On solvability of convex noncoercive quadratic programming problems
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- An example comparing the standard and safeguarded augmented Lagrangian methods
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Inexact Newton methods for solving nonsmooth equations
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- A nonsmooth version of Newton's method
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimization theory and methods. Nonlinear programming
- Multiplier and gradient methods
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- A New Active Set Algorithm for Box Constrained Optimization
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- Improving ultimate convergence of an augmented Lagrangian method
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Trust Region Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the Convergence of a Distributed Augmented Lagrangian Method for Nonconvex Optimization
- A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences
- On Regularization and Active-set Methods with Complexity for Constrained Optimization
- Augmented Lagrangians, box constrained QP and extensions
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
- Algorithm 813
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
- On sequential optimality conditions for smooth constrained optimization
- Benchmarking optimization software with performance profiles.
