On a relaxation method for mathematical programs with vanishing constraints

DOI10.1002/gamm.201210009zbMath1256.49032OpenAlexW1975123909MaRDI QIDQ4900439

Wolfgang Achtziger, Christian Kanzow, Tim Hoheisel

Publication date: 24 January 2013

Published in: GAMM-Mitteilungen (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/gamm.201210009

zbMATH Keywords

perturbationoptimality conditionsrelaxation methodvanishing constraints

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Numerical optimization and variational techniques (65K10) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods of relaxation type (49M20)

Related Items

Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints ⋮ A study of one-parameter regularization methods for mathematical programs with vanishing constraints ⋮ New dualities for mathematical programs with vanishing constraints ⋮ Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation ⋮ Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints ⋮ Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method ⋮ On the linear independence constraint qualification in disjunctive programming ⋮ On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints ⋮ An SQP method for mathematical programs with vanishing constraints with strong convergence properties ⋮ Relaxation schemes for mathematical programmes with switching constraints

Cites Work

• Unnamed Item
• Mathematical programs with vanishing constraints: critical point theory
• Exact penalty results for mathematical programs with vanishing 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
• Optimization with variable sets of constraints and an application to truss design
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
• Optimality conditions and newton-type methods for mathematical programs with vanishing constraints
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Strongly Regular Generalized Equations
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems