Regularity Conditions and Optimality in Vector Optimization
From MaRDI portal
Publication:4678762
DOI10.1081/NFA-200042637zbMath1071.90040MaRDI QIDQ4678762
No author found.
Publication date: 23 May 2005
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Charnes-Cooper scalarization and convex vector optimization, Necessary conditions for efficiency in terms of the Michel–Penot subdifferentials, Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems, Lagrangian conditions for vector optimization in Banach spaces, First-order necessary conditions in locally Lipschitz multiobjective optimization, Optimality and duality theorems in nonsmooth multiobjective optimization, On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization, Bounded sets of KKT multipliers in vector optimization, Boundedness of certain sets of Lagrange multipliers in vector optimization, Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems, ϵ-Efficient solutions in semi-infinite multiobjective optimization, Optimality conditions and duality in nonsmooth multiobjective optimization problems, An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems, Higher-Order Efficiency Conditions Via Higher-Order Tangent Cones, Optimality and duality for nonsmooth multiobjective optimization problems, Optimality and mixed saddle point criteria in multiobjective optimization, Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems, Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization, Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization, On alternative theorems and necessary conditions for efficiency, Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions, Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity, Second-order optimality conditions in locally Lipschitz inequality-constrained multiobjective optimization, Constraint qualifications in nonsmooth multiobjective optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Necessary conditions for optimality of nondifferentiable convex multiobjective programming
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Constraint qualifications in nonsmooth multiobjective optimization
- Characterization of nonsmooth functions through their generalized gradients
- Optimization and nonsmooth analysis
- Convexlike alternative theorems and mathematical programming
- Characterizations of strict local minima for some nonlinear programming problems
- INVEXITY AS NECESSARY OPTIMALITY CONDITION IN NONSMOOTH PROGRAMS
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Convex Analysis
