Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints

DOI10.1007/s10107-011-0488-5zbMath1262.65065OpenAlexW2040164128MaRDI QIDQ1942257

Alexandra Schwartz, Christian Kanzow, Tim Hoheisel

Publication date: 18 March 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-011-0488-5

zbMATH Keywords

comparisonglobal convergencerelaxation methodconstraint qualificationMathematical program with complementarity constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items

Smoothing and regularization strategies for optimization of hybrid dynamic systems, A study of one-parameter regularization methods for mathematical programs with vanishing constraints, On bilevel programs with a convex lower-level problem violating Slater's constraint qualification, Nonlinear optimization of district heating networks, Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization, Feasibility problems with complementarity constraints, Branch-and-cut for linear programs with overlapping SOS1 constraints, Optimal Control Problems with Terminal Complementarity Constraints, Bilevel Optimization: Reformulation and First Optimality Conditions, A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods, Mathematical programs with multiobjective generalized Nash equilibrium problems in the constraints, A special three-level optimization problem, Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints, Solving binary-constrained mixed complementarity problems using continuous reformulations, Optimal Control of Elastoplastic Processes: Analysis, Algorithms, Numerical Analysis and Applications, Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints, An augmented Lagrangian method for optimization problems with structured geometric constraints, MPCC strategies for nonsmooth nonlinear programs, First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition, Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming, Comparison of optimality systems for the optimal control of the obstacle problem, Solving optimal control problems with terminal complementarity constraints via Scholtes' relaxation scheme, Relaxed constant positive linear dependence constraint qualification for disjunctive systems, Focus programming: a bi‐level programming approach to static stochastic optimization problems, Bilevel programming approaches to production planning for multiple products with short life cycles, Pathfollowing for parametric mathematical programs with complementarity constraints, A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost, The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints, Single-level reformulations of a specific non-smooth bilevel programming problem and their applications, A survey on mixed-integer programming techniques in bilevel optimization, On approximate stationary points of the regularized mathematical program with complementarity constraints, Study of M-stationarity and strong stationarity for a class of SMPCC problems via SAA method, New constraint qualifications for mathematical programs with second-order cone complementarity constraints, Strong Stationarity Conditions for Optimal Control Problems Governed by a Rate-Independent Evolution Variational Inequality, Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC, Notes on some constraint qualifications for mathematical programs with equilibrium constraints, Unnamed Item, Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming, A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function, Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation, New results on constraint qualifications for nonlinear extremum problems and extensions, Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property, Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints, Strongly stable C-stationary points for mathematical programs with complementarity constraints, A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints, Mathematical programs with complementarity constraints in Banach spaces, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, Optimality conditions for the simple convex bilevel programming problem in Banach spaces, On the linear independence constraint qualification in disjunctive programming, Computing feasible points for binary MINLPs with MPECs, A comparison of solution approaches for the numerical treatment of or-constrained optimization problems, Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints, Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints, Convexification method for bilevel programs with a nonconvex Follower's problem, Towards M-stationarity for Optimal Control of the Obstacle Problem with Control Constraints, New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences, Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches, Weak and strong stationarity in generalized bilevel programming and bilevel optimal control, Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints, Second order variational analysis of disjunctive constraint sets and its applications to optimization problems, MPCC: strong stability of \(m\)-stationary points, On the structure of linear programs with overlapping cardinality constraints, Optimal control problems with control complementarity constraints: existence results, optimality conditions, and a penalty method, On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints, Solution of bilevel optimization problems using the KKT approach, Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces, On linear problems with complementarity constraints, Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method, Coupled versus decoupled penalization of control 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, Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences, MPEC Methods for Bilevel Optimization Problems, Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method, Relaxation schemes for mathematical programmes with switching constraints, Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints, A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints, On the solution of convex bilevel optimization problems

Uses Software

• MacMPEC

Cites Work

• Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
• Improved convergence properties of the Lin-Fukushima-regularization method for mathematical programs with complementarity constraints
• Lifting mathematical programs with complementarity constraints
• Foundations of optimization
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• A smoothing method for mathematical programs with equilibrium constraints
• Foundations of bilevel programming
• A modified relaxation scheme for mathematical programs with complementarity constraints
• On the relation between constant positive linear dependence condition and quasinormality constraint qualification
• Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
• Pseudonormality and a Lagrange multiplier theory for constrained optimization
• Abadie-type constraint qualification for mathematical programs with equilibrium 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
• Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
• A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
• Directional derivative of the marginal function in nonlinear programming
• A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints
• On the Guignard constraint qualification for mathematical programs with equilibrium constraints
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• Some properties of regularization and penalization schemes for MPECs
• Solving mathematical programs with complementarity constraints as nonlinear programs
• Optimality conditions for bilevel programming problems
• 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
• A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
• Interior Methods for Mathematical Programs with Complementarity Constraints
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Benchmarking optimization software with performance profiles.