A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods
DOI10.1287/moor.2021.1165zbMath1489.90197OpenAlexW3203415807MaRDI QIDQ5085138
No author found.
Publication date: 27 June 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2021.1165
augmented Lagrangian methodmathematical program with complementarity constraintsM-stationaritynonmonotone projected gradient method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of reduced gradient type (90C52)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Lifting mathematical programs with complementarity constraints
- A relaxed constant positive linear dependence constraint qualification and applications
- Convergence analysis of an augmented Lagrangian method for mathematical programs with complementarity constraints
- A smoothing method for mathematical programs with equilibrium constraints
- An example comparing the standard and safeguarded augmented Lagrangian methods
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- Partial augmented Lagrangian method and mathematical programs with complementarity constraints
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Two-Point Step Size Gradient Methods
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Variational Analysis
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Sparse Reconstruction by Separable Approximation
- Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints
- A Nonmonotone Line Search Technique for Newton’s Method
- Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints
- A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
- Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
- Complexity and performance of an Augmented Lagrangian algorithm
- Benchmarking optimization software with performance profiles.