Isolated and proper efficiencies in semi-infinite vector optimization problems
From MaRDI portal
Publication:467444
DOI10.1007/s10957-013-0425-2zbMath1319.90062OpenAlexW1966263955MaRDI QIDQ467444
Jen-Chih Yao, Thai Doan Chuong
Publication date: 3 November 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0425-2
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items
Optimality conditions in convex multiobjective SIP ⋮ Weak sharp efficiency in multiobjective optimization ⋮ Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints ⋮ Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming ⋮ Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ On global well-posedness of semi-infinite set optimization problems ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming ⋮ ϵ-Efficient solutions in semi-infinite multiobjective optimization ⋮ Isolated efficiency in nonsmooth semi-infinite multi-objective programming ⋮ Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty ⋮ Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications ⋮ Nondifferentiable fractional semi-infinite multiobjective optimization problems ⋮ Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems ⋮ Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems ⋮ Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data ⋮ Strong second-order Karush–Kuhn–Tucker optimality conditions for vector optimization ⋮ 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 ⋮ On the Hölder continuity of solution maps to parametric generalized vector quasi-equilibrium problems via nonlinear scalarization
Cites Work
- Unnamed Item
- Unnamed Item
- Density of stable convex semi-infinite vector optimization problems
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- Lower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimization
- Stability of properly efficient points and isolated minimizers of constrained vector optimization problems
- Subsmooth semi-infinite and infinite optimization problems
- Optimality and duality for proper and isolated efficiencies in multiobjective optimization
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- From scalar to vector optimization.
- Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives
- Stability of semi-infinite vector optimization problems under functional perturbations
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems
- On the notion of proper efficiency in vector optimization
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Variational methods in partially ordered spaces
- Nonsmooth semi-infinite multiobjective optimization problems
- Strong duality for proper efficiency in vector optimization
- Qualification and optimality conditions for dc programs with infinite constraints
- Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems
- Proper efficiency and the theory of vector maximization
- Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Subdifferentials of Marginal Functions in Semi-infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- A duality theorem for non-linear programming
- New Farkas-type constraint qualifications in convex infinite programming
- Convex Analysis
