First- and second-order optimality conditions for mathematical programs with vanishing constraints.
From MaRDI portal
Publication:954637
DOI10.1007/S10492-007-0029-YzbMATH Open1164.90407OpenAlexW1988831514MaRDI QIDQ954637FDOQ954637
Authors: T. Hoheisel, Christian Kanzow 
Publication date: 24 November 2008
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/33305
Recommendations
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
- Some non-smooth optimality results for optimization problems with vanishing constraints via Dini-Hadamard derivative
second-order optimality conditionsmathematical programs with equilibrium constraintsmathematical programs with vanishing constraintsfirst-order optimality conditions
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Mathematical Programs with Equilibrium Constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- Title not available (Why is that?)
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Nonconvex Structures in Nonlinear Programming
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints
Cited In (52)
- On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
- Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints
- Some non-smooth optimality results for optimization problems with vanishing constraints via Dini-Hadamard derivative
- First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints
- Necessary and sufficient conditions for M-stationarity of nonsmooth optimization problems with vanishing constraints
- Mond-Weir duality results for nondifferentiable mathematical programming with vanishing constraints
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- On stationarity for nonsmooth multiobjective problems with vanishing constraints
- Mathematical programs with vanishing constraints involving strongly invex functions
- Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
- Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
- Wolfe type duality for nonsmooth optimization problems with vanishing constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems
- On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints
- On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints
- Stationarity Condition for Nonsmooth MPVCs with Constraint Set
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
- Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints
- Mathematical programs with vanishing constraints: critical point theory
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
- Optimality results for nondifferentiable vector optimization problems with vanishing constraints
- Active-set Newton methods for mathematical programs with vanishing constraints
- The characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraints
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- On directionally differentiable multiobjective programming problems with vanishing constraints
- Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints
- On duality for mathematical programs with vanishing constraints
- Duality for multiobjective optimization problem with vanishing constraints
- On the linear independence constraint qualification in disjunctive programming
- Exact penalty results for mathematical programs with vanishing constraints
- On constraint qualifications for multiobjective optimization problems with vanishing constraints
- On a relaxation method for mathematical programs with vanishing constraints
- Decomposition and Approximation for PDE-Constrained Mixed-Integer Optimal Control
- New dualities for mathematical programs with vanishing constraints
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
- Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
- Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems with vanishing constraints on Hadamard manifolds
- On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints
- Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
- A linearized approach for solving differentiable vector optimization problems with vanishing constraints
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints
- A study of one-parameter regularization methods for mathematical programs with vanishing constraints
- Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators
- On multiobjective fractional programs with vanishing constraints
- Wolfe type duality on quasidifferentiable mathematical programs with vanishing constraints
This page was built for publication: First- and second-order optimality conditions for mathematical programs with vanishing constraints.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954637)
