Exact penalty results for mathematical programs with vanishing constraints
From MaRDI portal
Publication:844990
DOI10.1016/j.na.2009.10.047zbMath1185.90187OpenAlexW2068533472MaRDI QIDQ844990
Christian Kanzow, Tim Hoheisel, Jiří V. Outrata
Publication date: 5 February 2010
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2009.10.047
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A study of one-parameter regularization methods for mathematical programs with vanishing constraints ⋮ Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints ⋮ On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints ⋮ Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties ⋮ On duality for mathematical programs with vanishing constraints ⋮ On relations between chance constrained and penalty function problems under discrete distributions ⋮ A smoothing-regularization approach to mathematical programs with vanishing constraints ⋮ New dualities for mathematical programs with vanishing constraints ⋮ Active-set Newton methods for mathematical programs with vanishing constraints ⋮ Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints ⋮ Mathematical programs with vanishing constraints involving strongly invex functions ⋮ Necessary and sufficient conditions for M-stationarity of nonsmooth optimization problems with vanishing constraints ⋮ On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints ⋮ Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications ⋮ Mathematical programs with vanishing constraints: critical point theory ⋮ Stationarity Condition for Nonsmooth MPVCs with Constraint Set ⋮ On estimating the regular normal cone to constraint systems and stationarity conditions ⋮ A new class of exact penalty functions and penalty algorithms ⋮ On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem ⋮ Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints ⋮ New exact penalty functions for nonlinear constrained optimization problems ⋮ On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems ⋮ Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method ⋮ On a relaxation method for mathematical programs with vanishing constraints ⋮ On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints ⋮ Quantitative stability of a generalized equation ⋮ Exact penalization in stochastic programming -- calmness and constraint qualification ⋮ On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- On metric and calmness qualification conditions in subdifferential calculus
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Error bounds in mathematical programming
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Calmness of constraint systems with applications
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Calmness and Exact Penalization
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Exact penalty functions in nonlinear programming
- An Exact Penalization Viewpoint of Constrained Optimization
- Strong Rotundity and Optimization
- Variational Analysis
