Constraint qualifications in convex vector semi-infinite optimization
From MaRDI portal
Publication:320868
DOI10.1016/J.EJOR.2015.08.062zbMATH Open1346.90783OpenAlexW3022286450MaRDI QIDQ320868FDOQ320868
Authors: Maxim Ivanov Todorov, Miguel Angel Goberna, Francisco Guerra Vazquez 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/53846
Recommendations
Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Cites Work
- Title not available (Why is that?)
- Stability of semi-infinite vector optimization problems under functional perturbations
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Kuratowksi convergence of the efficient sets in the parametric linear vector semi-infinite optimization
- Title not available (Why is that?)
- Density of stable convex semi-infinite vector optimization problems
- Title not available (Why is that?)
- Multicriteria Optimization
- Title not available (Why is that?)
- Proper efficiency and the theory of vector maximization
- Title not available (Why is that?)
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Locally Farkas-Minkowski linear inequality systems
- Minmax robustness for multi-objective optimization problems
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
- Recent contributions to linear semi-infinite optimization
- Nonsmooth semi-infinite multiobjective optimization problems
- Constraint qualifications in linear vector semi-infinite optimization
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- {\(\Gamma\)}-active constraints in convex semi-infinite programming
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Title not available (Why is that?)
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Semi-infinite multiobjective programming with generalized invexity
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- New Farkas-type constraint qualifications in convex infinite programming
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (25)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
- New qualification conditions for convex optimization without convex representation
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Title not available (Why is that?)
- Optimality theorems for convex semidefinite vector optimization problems
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- 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
- Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- 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
- Recent contributions to linear semi-infinite optimization
- Title not available (Why is that?)
- Optimality conditions in convex multiobjective SIP
- $$\varPhi -$$ Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming
- Constraint qualifications in linear vector semi-infinite optimization
- Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials
- Recent contributions to linear semi-infinite optimization: an update
- An extension of the basic constraint qualification to nonconvex vector optimization problems
This page was built for publication: Constraint qualifications in convex vector semi-infinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320868)
