Optimality conditions in convex multiobjective SIP
From MaRDI portal
Publication:2364489
DOI10.1007/S10107-016-1081-8zbMath1387.90234arXiv1608.03115OpenAlexW2492901707MaRDI QIDQ2364489
Nader Kanzi, Miguel Angel Goberna
Publication date: 21 July 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.03115
Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (19)
Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming ⋮ Recent contributions to linear semi-infinite optimization ⋮ Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ On optimality conditions and duality for multiobjective optimization with equilibrium constraints ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ Unnamed Item ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming ⋮ ϵ-Efficient solutions in semi-infinite multiobjective optimization ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Optimality, scalarization and duality in linear vector semi-infinite programming ⋮ Isolated efficiency in nonsmooth semi-infinite multi-objective programming ⋮ $$\varPhi -$$ Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming ⋮ Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions ⋮ Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint qualifications in convex vector semi-infinite optimization
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- The gap function for optimization problems in Banach spaces
- From scalar to vector optimization.
- On the subdifferentiability of the difference of two functions and local minimization
- The gap function of a convex program
- Conjugate duality in vector optimization
- The gap function of a convex multicriteria optimization problem
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Semi-infinite optimization: Structure and stability of the feasible set
- Nonsmooth semi-infinite multiobjective optimization problems
- Constraint qualifications in linear vector semi-infinite optimization
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- On Proper Efficiency in Multiobjective Semi-infinite Optimization
- Nonsmooth Optimization Using Mordukhovich's Subdifferential
- Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions
- Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
- Closedness conditions for the optimality of a family of non-convex optimization problems
- Stability in Mathematical Programming with Nondifferentiable Data
- Revisiting the gap function of a multicriteria optimization problem
- New Farkas-type constraint qualifications in convex infinite programming
- Convex Analysis
This page was built for publication: Optimality conditions in convex multiobjective SIP
