On stationarity for nonsmooth multiobjective problems with vanishing constraints
DOI10.1007/s10898-021-01030-1OpenAlexW3162651549MaRDI QIDQ2124809
Giuseppe Caristi, Nader Kanzi, David Barilla, Ali Sadeghieh
Publication date: 11 April 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01030-1
multiobjective optimizationvanishing constraintsqualification conditionstationary conditiontightened problem
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions for free problems in two or more independent variables (49K10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On duality for mathematical programs with vanishing constraints
- Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Constraint qualifications in nonsmooth multiobjective optimization
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Optimization and nonsmooth analysis
- Optimality, scalarization and duality in linear vector semi-infinite programming
- Implicit Functions and Optimization Problems without Continuous Differentiability of the Data
