On set containment characterization and constraint qualification for quasiconvex programming
From MaRDI portal
Publication:637546
DOI10.1007/S10957-011-9804-8zbMATH Open1229.90208OpenAlexW1987623670MaRDI QIDQ637546FDOQ637546
Authors: Satoshi Suzuki, Daishi Kuroiwa 
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
Recommendations
- Set containment characterization for quasiconvex programming
- Set containment characterization with strict and weak quasiconvex inequalities
- On constraint qualification for an infinite system of quasiconvex inequalities in normed linear space
- Constraint qualification for quasiconvex inequality system with applications in constraint optimization
- Optimality conditions and constraint qualifications for quasiconvex programming
Cites Work
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- An alternative formulation for a new closed cone constraint qualification
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- On Quasi-Convex Duality
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- On strong and total Lagrange duality for convex optimization problems
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Set containment characterization
- Dual characterizations of set containments with strict convex inequalities
- Set containment characterization for quasiconvex programming
Cited In (25)
- Sandwich theorem for quasiconvex functions and its applications
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system
- Necessary and sufficient constraint qualification for surrogate duality
- Set containment characterization with strict and weak quasiconvex inequalities
- Quasiconvex duality theorems with quasiconjugates and generator
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- Subdifferential calculus for a quasiconvex function with generator
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- On set containment characterizations for sets described by set-valued maps with applications
- 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
- Minimizing the difference of two quasiconvex functions
- Observations of closed cone constraint qualification for quasiconvex programming
- Some constraint qualifications for quasiconvex vector-valued systems
- Duality theorems for convex and quasiconvex set functions
- On constraint qualifications for an infinite system of quasiconvex inequalities
- Set containment characterization for quasiconvex programming
- Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
- Strong and total Lagrange dualities for quasiconvex programming
- Optimality conditions and constraint qualifications for quasiconvex programming
- Strong and total Lagrange dualities for quasiconvex programming
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
This page was built for publication: On set containment characterization and constraint qualification for quasiconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q637546)
