Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
From MaRDI portal
Publication:2885492
DOI10.1080/10556788.2010.535170zbMath1266.90170OpenAlexW1987024398MaRDI QIDQ2885492
Christian Kanzow, Alexandra Schwartz, Tim Hoheisel
Publication date: 23 May 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2010.535170
global convergenceregularization methodmathematical programmes with equilibrium constraintsmathematical programmes with vanishing constraints
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (22)
A study of one-parameter regularization methods for mathematical programs with vanishing constraints ⋮ Relaxation approach for equilibrium problems with equilibrium constraints ⋮ A smoothing-regularization approach to mathematical programs with vanishing constraints ⋮ A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints ⋮ New dualities for mathematical programs with vanishing constraints ⋮ Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints ⋮ Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming ⋮ Relaxed constant positive linear dependence constraint qualification for disjunctive systems ⋮ Focus programming: a bi‐level programming approach to static stochastic optimization problems ⋮ Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints ⋮ Mathematical programs with vanishing constraints: critical point theory ⋮ Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints ⋮ Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property ⋮ Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method ⋮ On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach ⋮ On a relaxation method for mathematical programs with vanishing constraints ⋮ On the linear independence constraint qualification in disjunctive programming ⋮ On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints ⋮ Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints ⋮ On linear problems with complementarity constraints ⋮ The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited ⋮ Relaxation schemes for mathematical programmes with switching constraints
Uses Software
Cites Work
- Mathematical programs with vanishing constraints: critical point theory
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- A smoothing method for mathematical programs with equilibrium constraints
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- On M-stationary points for mathematical programs with equilibrium constraints
- Optimality conditions for disjunctive programs with application to 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 Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
- Directional derivative of the marginal function in nonlinear programming
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- On Stability of the Feasible Set of a Mathematical Problem with Complementarity Problems
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Optimization and nonsmooth analysis
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- A Generalized Mathematical Program 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 Optimization Problems with Complementarity Constraints
- On a relaxation method for mathematical programs with vanishing constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium 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
This page was built for publication: Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
