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