On set containment characterization and constraint qualification for quasiconvex programming
From MaRDI portal
Publication:637546
DOI10.1007/s10957-011-9804-8zbMath1229.90208OpenAlexW1987623670MaRDI QIDQ637546
Daishi Kuroiwa, Satoshi Suzuki
Publication date: 6 September 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9804-8
Related Items (18)
Duality theorems for separable convex programming without qualifications ⋮ Nonlinear error bounds for quasiconvex inequality systems ⋮ Optimality conditions and the basic constraint qualification for quasiconvex programming ⋮ Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming ⋮ Necessary and sufficient constraint qualification for surrogate duality ⋮ Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system ⋮ Some constraint qualifications for quasiconvex vector-valued systems ⋮ Duality theorems for convex and quasiconvex set functions ⋮ Minimizing the difference of two quasiconvex functions ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ Sandwich theorem for quasiconvex functions and its applications ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Subdifferential calculus for a quasiconvex function with generator ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Strong and total Lagrange dualities for quasiconvex programming
Cites Work
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- Set containment characterization for quasiconvex programming
- Set containment characterization
- On strong and total Lagrange duality for convex optimization problems
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- An alternative formulation for a new closed cone constraint qualification
- Dual characterizations of set containments with strict convex inequalities
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- On Quasi-Convex Duality
This page was built for publication: On set containment characterization and constraint qualification for quasiconvex programming
