Optimality conditions in convex multiobjective SIP
From MaRDI portal
Publication:2364489
Abstract: The purpose of this paper is to characterize the weak efficient solutions, the efficient solutions, and the isolated efficient solutions of a given vector optimization problem with finitely many convex objective functions and infinitely many convex constraints. To do this, we introduce new and already known data qualifications (conditions involving the constraints and/or the objectives) in order to get optimality conditions which are expressed in terms of either Karusk-Kuhn-Tucker multipliers or a new gap function associated with the given problem.
Recommendations
- Constraint qualifications in convex vector semi-infinite optimization
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- scientific article; zbMATH DE number 721757
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Constraint qualifications in linear vector semi-infinite optimization
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3511879 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- Closedness conditions for the optimality of a family of non-convex optimization problems
- Conjugate duality in vector optimization
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Constraint qualifications for semi-infinite systems of convex inequalities
- Constraint qualifications in convex vector semi-infinite optimization
- Constraint qualifications in linear vector semi-infinite optimization
- Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
- Convex Analysis
- From scalar to vector optimization.
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- New Farkas-type constraint qualifications in convex infinite programming
- Nonsmooth optimization using Mordukhovich's subdifferential
- Nonsmooth semi-infinite multiobjective optimization problems
- On Proper Efficiency in Multiobjective Semi-infinite Optimization
- On robust convex multiobjective optimization
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- On the subdifferentiability of the difference of two functions and local minimization
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Revisiting the gap function of a multicriteria optimization problem
- Semi-infinite multiobjective programming with generalized invexity
- Semi-infinite optimization: Structure and stability of the feasible set
- Sensitivity analysis in linear semi-infinite programming via partitions
- 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
- Stability in Mathematical Programming with Nondifferentiable Data
- The gap function for optimization problems in Banach spaces
- The gap function of a convex multicriteria optimization problem
- The gap function of a convex program
Cited in
(22)- Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- \(\varPhi\)-weak Slater constraint qualification in nonsmooth multiobjective semi-infinite programming
- On nonsmooth multiobjective semi-infinite programming problems with mixed constraints
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- Recent contributions to linear semi-infinite optimization: an update
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds
- 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
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- Recent contributions to linear semi-infinite optimization
- scientific article; zbMATH DE number 1019601 (Why is no real title available?)
- Constraint qualifications in convex vector semi-infinite optimization
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
- Upper level qualifications and optimality in multiobjective convex generalized semi-infinite problems
- Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality
- On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- Optimality, scalarization and duality in linear vector semi-infinite programming
This page was built for publication: Optimality conditions in convex multiobjective SIP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364489)
