Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
From MaRDI portal
Publication:6487244
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48)
Recommendations
- Some non-smooth optimality results for optimization problems with vanishing constraints via Dini-Hadamard derivative
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3905307 (Why is no real title available?)
- scientific article; zbMATH DE number 3246195 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- A Generalized Mathematical Program with Equilibrium Constraints
- A Necessary and Sufficient Qualification for Constrained Optimization
- A generalized derivative for calm and stable functions
- A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
- Active-set Newton methods for mathematical programs with vanishing constraints
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- Convex Analysis
- Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
- Exact penalty results for mathematical programs with vanishing constraints
- Existence of minimizers and necessary conditions in set-valued optimization with equilibrium constraints.
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Foundations of optimization
- Generalized convexity and optimization. Theory and applications
- Mathematical Programs with Equilibrium Constraints
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Multiplier rules under mixed assumptions of differentiability and Lipschitz continuity
- Necessary and sufficient conditions for M-stationarity of nonsmooth optimization problems with vanishing constraints
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- Necessary conditions in nonsmooth minimization via lower and upper subgradients
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- New dualities for mathematical programs with vanishing constraints
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- Nondifferentiable multiplier rules for optimization problems with equilibrium constraints
- Nonsmooth analysis
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Numerical Optimization
- On M-stationary points for mathematical programs with equilibrium constraints
- On constraint qualifications for multiobjective optimization problems with vanishing constraints
- On constraint qualifications in nonsmooth optimization.
- On duality for mathematical programs with vanishing constraints
- On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- On the cones of tangents with applications to mathematical programming
- Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
- Optimization and nonsmooth analysis
- Semiregularity and Generalized Subdifferentials with Applications to Optimization
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Suboptimality conditions for mathematical programs with equilibrium constraints
- The characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraints
Cited in
(2)
This page was built for publication: Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487244)
