Constraint qualifications in nonsmooth multiobjective optimization
From MaRDI portal
Publication:1594878
DOI10.1023/A:1004607615343zbMath0976.90092MaRDI QIDQ1594878
Publication date: 29 January 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Lipschitz continuityClarke subdifferentialconstraint qualificationsnonsmooth multiobjective optimizationKT necessary conditions
Multi-objective and goal programming (90C29) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (25)
On stationarity for nonsmooth multiobjective problems with vanishing constraints ⋮ Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ On Abadie constraint qualification for multiobjective optimization problems ⋮ Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems ⋮ Lagrangian conditions for vector optimization in Banach spaces ⋮ First-order necessary conditions in locally Lipschitz multiobjective optimization ⋮ Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions ⋮ Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results ⋮ On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints ⋮ Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds ⋮ Bounded sets of KKT multipliers in vector optimization ⋮ Generalized \((F,\rho )\)-convexity and duality in nonsmooth problems of multiobjective optimization ⋮ Unnamed Item ⋮ Some kind of Pareto stationarity for multiobjective problems with equilibrium constraints ⋮ Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems ⋮ ϵ-Efficient solutions in semi-infinite multiobjective optimization ⋮ On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ On the robustness of global optima and stationary solutions to stochastic mathematical programs with equilibrium constraints. I: Theory ⋮ Regularity Conditions and Optimality in Vector Optimization ⋮ Optimality conditions for non-smooth semi-infinite programming ⋮ On alternative theorems and necessary conditions for efficiency ⋮ Unnamed Item ⋮ Constraint qualifications in nonsmooth multiobjective optimization problem ⋮ On Tucker-type alternative theorems and necessary optimality conditions for nonsmooth multiobjective optimization
Cites Work
- Unnamed Item
- General constraint qualifications in nondifferentiable programming
- Generalizations of Slater's constraint qualification for infinite convex programs
- Error bounds for generalized Lagrange multipliers in locally Lipschitz programming
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Approximate necessary conditions for locally weak Pareto optimality
- A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Optimization and nonsmooth analysis
- On conditions to have bounded multipliers in locally lipschitz programming
- Tangent Sets’ Calculus and Necessary Conditions for Extremality
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- On optimality conditions in nondifferentiable programming
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Convex Analysis
- A Necessary and Sufficient Qualification for Constrained Optimization
- Constraint Qualifications Revisited
- A Note on Motzkin's Transposition Theorem
This page was built for publication: Constraint qualifications in nonsmooth multiobjective optimization