Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications

From MaRDI portal
Publication:2382702

DOI10.1016/j.jmaa.2007.03.087zbMath1141.90572OpenAlexW2046681554MaRDI QIDQ2382702

Christian Kanzow, Tim Hoheisel

Publication date: 2 October 2007

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2007.03.087




Related Items

Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraintsOn stationarity for nonsmooth multiobjective problems with vanishing constraintsA study of one-parameter regularization methods for mathematical programs with vanishing constraintsConstraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraintsOn M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraintsLipschitz and Hölder stability of optimization problems and generalized equationsMathematical programs with vanishing constraints: a new regularization approach with strong convergence propertiesExact penalty results for mathematical programs with vanishing constraintsThe characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraintsKarush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraintsOn duality for mathematical programs with vanishing constraintsA smoothing-regularization approach to mathematical programs with vanishing constraintsOptimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraintsNew dualities for mathematical programs with vanishing constraintsActive-set Newton methods for mathematical programs with vanishing constraintsOn strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraintsEnhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraintsStationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programmingOptimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraintsNecessary and sufficient conditions for M-stationarity of nonsmooth optimization problems with vanishing constraintsRelaxed constant positive linear dependence constraint qualification for disjunctive systemsSecond-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive SystemsOn Constraint Qualifications for Multiobjective Optimization Problems with Vanishing ConstraintsOn directionally differentiable multiobjective programming problems with vanishing constraintsMathematical programs with vanishing constraints: critical point theoryStationarity Condition for Nonsmooth MPVCs with Constraint SetUnnamed ItemOn estimating the regular normal cone to constraint systems and stationarity conditionsNotes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraintsMathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization methodOn a relaxation method for mathematical programs with vanishing constraintsKarush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraintsFirst- and second-order optimality conditions for mathematical programs with vanishing constraints.On an \(l_1\) exact penalty result for mathematical programs with vanishing constraintsMathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problemsUnnamed ItemOptimality conditions and exact penalty for mathematical programs with switching constraintsOn an exact penality result and new constraint qualifications for mathematical programs with vanishing constraintsUnnamed ItemDuality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraintsMathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation methodSome non-smooth optimality results for optimization problems with vanishing constraints via Dini-Hadamard derivativeRelaxation schemes for mathematical programmes with switching constraints


Uses Software


Cites Work


This page was built for publication: Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications