Constraint qualifications in convex vector semi-infinite optimization
From MaRDI portal
(Redirected from Publication:320868)
Recommendations
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 721843 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 5493307 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 3378720 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications in linear vector semi-infinite optimization
- Density of stable convex semi-infinite vector optimization problems
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
- Kuratowksi convergence of the efficient sets in the parametric linear vector semi-infinite optimization
- Locally Farkas-Minkowski linear inequality systems
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- New Farkas-type constraint qualifications in convex infinite programming
- Nonsmooth semi-infinite multiobjective optimization problems
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Proper efficiency and the theory of vector maximization
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Recent contributions to linear semi-infinite optimization
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Semi-infinite multiobjective programming with generalized invexity
- Stability of semi-infinite vector optimization problems under functional perturbations
- {\(\Gamma\)}-active constraints in convex semi-infinite programming
Cited in
(26)- 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
- Optimality conditions in convex multiobjective SIP
- Constraint qualifications in linear vector semi-infinite optimization
- scientific article; zbMATH DE number 7468708 (Why is no real title available?)
- New qualification conditions for convex optimization without convex representation
- Optimality theorems for convex semidefinite vector optimization problems
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Nonsmooth constraint qualifications for nonconvex inequality systems
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- scientific article; zbMATH DE number 6988801 (Why is no real title available?)
- Recent contributions to linear semi-infinite optimization: an update
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Higher-order Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Recent contributions to linear semi-infinite optimization
- On vector generalized semi-infinite programming
- An extension of the basic constraint qualification to nonconvex vector optimization problems
- scientific article; zbMATH DE number 7293696 (Why is no real title available?)
- scientific article; zbMATH DE number 2158983 (Why is no real title available?)
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- Optimality, scalarization and duality in linear vector semi-infinite programming
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)
