A constraint qualification characterizing surrogate duality for quasiconvex programming
From MaRDI portal
Recommendations
- Necessary and sufficient constraint qualification for surrogate duality
- Surrogate Programming and Multipliers in Quasi-convex Programming
- Observations of closed cone constraint qualification for quasiconvex programming
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- On set containment characterization and constraint qualification for quasiconvex programming
Cited in
(11)- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Duality for quasiconvex minimization over closed convex cones
- Duality theorems for convex and quasiconvex set functions
- Duality theorems for separable convex programming without qualifications
- Observations of closed cone constraint qualification for quasiconvex programming
- A surrogate dual algorithm for quasiconvex quadratic problems
- scientific article; zbMATH DE number 3909181 (Why is no real title available?)
- scientific article; zbMATH DE number 3963578 (Why is no real title available?)
- Necessary and sufficient constraint qualification for surrogate duality
- Surrogate Programming and Multipliers in Quasi-convex Programming
- Surrogate duality for optimization problems involving set functions
This page was built for publication: A constraint qualification characterizing surrogate duality for quasiconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789161)