Lifting mathematical programs with complementarity constraints
From MaRDI portal
Publication:662308
DOI10.1007/s10107-010-0345-yzbMath1250.90094OpenAlexW2048416666MaRDI QIDQ662308
Publication date: 22 February 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0345-y
Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)
Related Items
On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods, A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods, Feasible method for generalized semi-infinite programming, The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets, The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization, New constraint qualifications for mathematical programs with second-order cone complementarity constraints, The demand adjustment problem via inexact restoration method, Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints, Optimality conditions for mathematical programs with orthogonality type constraints, Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints, A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems, A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function, How to solve a semi-infinite optimization problem, Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption, Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints, A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS, The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Interior-point algorithms, penalty methods and equilibrium problems
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- On inertia and Schur complement in optimization
- Schur complements and statistics
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- A QP-free constrained Newton-type method for variational inequality problems
- Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- Hybrid approach with active set identification for mathematical programs with complementarity constraints
- A robust SQP method for mathematical programs with linear complementarity constraints
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- On Stability of the Feasible Set of a Mathematical Problem with Complementarity Problems
- Critical sets in parametric optimization
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Tilt Stability of a Local Minimum
- Some properties of regularization and penalization schemes for MPECs
- MPCC: Critical Point Theory
- A Sequential Smooth Penalization Approach to 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
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.
