Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints
From MaRDI portal
Publication:5026840
DOI10.1137/20M1370501zbMath1484.90126arXiv2009.14047OpenAlexW3090783725MaRDI QIDQ5026840
Paul Manns, Sven Leyffer, Christian Kirches, Jeffrey Larson
Publication date: 8 February 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.14047
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An adaptive augmented Lagrangian method for large-scale constrained optimization
- Interfaces to PATH 3.0: Design, implementation and usage
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Nonlinear programming and nonsmooth optimization by successive linear programming
- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Complementary pivot theory of mathematical programming
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- A pivoting algorithm for linear programming with linear complementarity constraints
- Improving ultimate convergence of an augmented Lagrangian method
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Large-scale linearly constrained optimization
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers
- On the Global Convergence of a Filter--SQP Algorithm
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Nonlinear programming without a penalty function.
