Constraint qualifications in convex vector semi-infinite optimization
From MaRDI portal
Publication:320868
DOI10.1016/j.ejor.2015.08.062zbMath1346.90783OpenAlexW3022286450MaRDI QIDQ320868
Maxim Ivanov Todorov, Miguel Angel Goberna, Francisco Guerra Vázquez
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
Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (19)
Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems ⋮ Optimality conditions in convex multiobjective SIP ⋮ New qualification conditions for convex optimization without convex representation ⋮ 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 ⋮ Recent contributions to linear semi-infinite optimization ⋮ Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation ⋮ Unnamed Item ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ ϵ-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 ⋮ Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ $$\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 ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minmax robustness for multi-objective optimization problems
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Density of stable convex semi-infinite vector optimization problems
- 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
- Locally Farkas-Minkowski linear inequality systems
- 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
- Proper efficiency and the theory of vector maximization
- First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
- γ-Active Constraints in Convex Semi-Infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Multicriteria Optimization
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: Constraint qualifications in convex vector semi-infinite optimization
