A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
From MaRDI portal
Publication:2848173
DOI10.1137/100802487zbMath1282.65069MaRDI QIDQ2848173
Christian Kanzow, Alexandra Schwartz
Publication date: 25 September 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7da41963b2a38571ba59df8395b236cdf07ec7b5
global convergence; numerical results; regularization method; constraint qualifications; mathematical programs with complementarity constraints; M-stationarity; strong stationarity
65K05: Numerical mathematical programming methods
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC, Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints, A study of one-parameter regularization methods for mathematical programs with vanishing constraints, A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods, A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints, The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited, Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method, Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences, Relaxation schemes for mathematical programmes with switching constraints, MPCC strategies for nonsmooth nonlinear programs, Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, A two-stage trajectory prediction algorithm for mobile robots combining the Bayesian and the DMOC frameworks, New constraint qualifications for mathematical programs with second-order cone complementarity constraints, Strongly Stable Stationary Points for a Class of Generalized Equations, On solving difference of convex functions programs with linear complementarity constraints, Second-order optimality conditions for mathematical programs with equilibrium constraints, Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints, Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints, On bilevel programs with a convex lower-level problem violating Slater's constraint qualification, Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization, Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints, Notes on some constraint qualifications for mathematical programs with equilibrium constraints, A comparison of solution approaches for the numerical treatment of or-constrained optimization problems, Sequential optimality conditions for cardinality-constrained optimization problems with applications, An augmented Lagrangian method for cardinality-constrained optimization problems, MPCC: strong stability of \(m\)-stationary points, On linear problems with complementarity constraints, On approximate stationary points of the regularized mathematical program with complementarity constraints, Strongly stable C-stationary points for mathematical programs with complementarity constraints, Two new weak constraint qualifications for mathematical programs with equilibrium constraints and applications, Conic approximation to quadratic optimization with linear complementarity constraints, Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints, The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints, Structural properties of affine sparsity constraints, Towards M-stationarity for Optimal Control of the Obstacle Problem with Control Constraints, Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties, On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints
Uses Software
