Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints
From MaRDI portal
Recommendations
- On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints
- Convergence analysis of an augmented Lagrangian method for mathematical programs with complementarity constraints
- Global convergence of augmented Lagrangian methods applied to optimization problems with degenerate constraints, including problems with complementarity constraints
- Convergence properties of a second order augmented Lagrangian method for mathematical programs with complementarity constraints
- A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
Cites work
- A relaxed constant positive linear dependence constraint qualification and applications
- A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
- Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints
- Global convergence of augmented Lagrangian methods applied to optimization problems with degenerate constraints, including problems with complementarity constraints
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- New reformulations for stochastic nonlinear complementarity problems
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the linear independence constraint qualification in disjunctive programming
- Optimality conditions and exact penalty for mathematical programs with switching constraints
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
This page was built for publication: Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2691360)