Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
From MaRDI portal
Publication:890525
DOI10.1016/J.JMAA.2015.08.013zbMATH Open1334.90183OpenAlexW2212661953MaRDI QIDQ890525FDOQ890525
Authors: Nader Kanzi, Majid Soleimani-Damaneh 
Publication date: 10 November 2015
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2015.08.013
Recommendations
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Optimality conditions for semi-infinite programming problems under relaxed quasiconvexity assumptions
- Generalizations of Slater's constraint qualification for infinite convex programs
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
- Optimality conditions for semi-infinite programming problems involving generalized convexity
Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Cites Work
- Quasiconvex duality theory by generalized conjugation methods
- Differential and sensitivity properties of gap functions for vector variational inequalities
- Semi-Infinite Programming: Theory, Methods, and Applications
- Optimality Conditions for Quasiconvex Programs
- Title not available (Why is that?)
- What is quasiconvex analysis?
- On Quasi-Convex Duality
- Semi-infinite programming
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- Nonsmooth semi-infinite programming problems with mixed constraints
- Optimality conditions for non-smooth semi-infinite programming
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Optimality conditions for nondifferentiable convex semi-infinite programming
- The gap function of a convex program
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Characterization of solution sets of quasiconvex programs
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Surrogate Programming and Multipliers in Quasi-convex Programming
- Title not available (Why is that?)
- Derivatives of set-valued maps and gap functions for vector equilibrium problems
- The gap function for optimization problems in Banach spaces
- Title not available (Why is that?)
- Weak lower subdifferentials and applications
- Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
- DC optimization approach to metric regularity of convex multifunctions with applications to infinite systems
Cited In (15)
- Title not available (Why is that?)
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- On stationarity for nonsmooth multiobjective problems with vanishing constraints
- Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
- Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
- On nonsmooth multiobjective semi-infinite programming problems with mixed constraints
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Optimality conditions in convex multiobjective SIP
- On nondifferentiable semi-infinite multiobjective programming with interval-valued functions
This page was built for publication: Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890525)
