Duality theorems for separable convex programming without qualifications
It is known that with respect to Lagrange duality for separable convex programming problems strong duality in sense of ``sup=inf holds. That means that there is no duality gap but one cannot guarantee that optimal Lagrange multipliers exist. For this additional constraint qualifications are necessary. In the main part of the paper it is shown that separable convex inequality systems always satisfy a weak constraint qualification (the so-called closed cone constraint qualification Q-CCCQ) which is necessary and sufficient for a generalized Lagrange-type duality in quasiconvex programming. Hence, a strong duality assertion in sense of ``inf=max without constraint qualification can be derived for this duality concept for separable convex optimization problems. A further duality theorem and a necessary and sufficient optimality condition for a separable convex programming problem where the Slater condition fails are provided.
- A constraint qualification characterizing surrogate duality for quasiconvex programming
- An alternative formulation for a new closed cone constraint qualification
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Farkas' lemma for separable sublinear inequalities without qualifications
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Necessary and sufficient constraint qualification for surrogate duality
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- New strong duality results for convex programs with separable constraints
- On Quasi-Convex Duality
- On set containment characterization and constraint qualification for quasiconvex programming
- On strong and total Lagrange duality for convex optimization problems
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Quasiconvex duality theory by generalized conjugation methods
- Some constraint qualifications for quasiconvex vector-valued systems
- Some convex programs without a duality gap
- Subdifferential calculus for a quasiconvex function with generator
- Surrogate duality for robust optimization
- Additively separable duality theory
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Duality theorems for convex and quasiconvex set functions
- Optimality conditions and constraint qualifications for quasiconvex programming
- Characterizations of the solution sets of generalized convex fuzzy optimization problem
- scientific article; zbMATH DE number 3934789 (Why is no real title available?)
- scientific article; zbMATH DE number 3970543 (Why is no real title available?)
- On closedness conditions, strong separation, and convex duality
- scientific article; zbMATH DE number 5662944 (Why is no real title available?)
- New strong duality results for convex programs with separable constraints
- Some convex programs without a duality gap
This page was built for publication: Duality theorems for separable convex programming without qualifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359787)
