On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints
From MaRDI portal
Publication:2269590
DOI10.1007/s10898-009-9419-xzbMath1191.90069OpenAlexW2053630114MaRDI QIDQ2269590
Publication date: 17 March 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9419-x
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems ⋮ Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming ⋮ On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming ⋮ A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints ⋮ Saddle points of general augmented Lagrangians for constrained nonconvex optimization ⋮ Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming ⋮ A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints ⋮ Convergence results of an augmented Lagrangian method using the exponential penalty function
Cites Work
- Unnamed Item
- On the convergence of the exponential multiplier method for convex programming
- Convergence analysis of an augmented Lagrangian method for mathematical programs with complementarity constraints
- Modified barrier functions (theory and methods)
- A smoothing method for mathematical programs with equilibrium constraints
- New NCP-functions and their properties
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- 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
- An Augmented Lagrangian Function with Improved Exactness Properties
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- Lagrange Multipliers and Optimality
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Convergence properties of augmented Lagrangian methods for constrained global optimization
- Global Optimization Approach to the Linear Complementarity Problem
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
- Log-sigmoid multipliers method in constrained optimization
