Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
From MaRDI portal
(Redirected from Publication:5408217)
Recommendations
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Explicit optimality conditions for convex semi-infinite programming problems
Cited in
(20)- Generalizations of Slater's constraint qualification for infinite convex programs
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
- Strong and total Fenchel dualities for robust convex optimization problems
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- Duality for sets of strong Slater points
- Asymptotic optimality conditions for linear semi-infinite programming
- Constraint qualifications in convex vector semi-infinite optimization
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
- Duality and saddle point theorems of approximate solutions for nonsmooth semi-infinite multiobjective optimization problems
- On constraint qualifications of a nonconvex inequality
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
This page was built for publication: Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408217)
