Pages that link to "Item:Q959958"

The following pages link to Some convex programs without a duality gap (Q959958):

Displaying 24 items.

• New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
• Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
• Further study on strong Lagrangian duality property for invex programs via penalty functions (Q608016) (← links)
• New strong duality results for convex programs with separable constraints (Q613429) (← links)
• Farkas' lemma for separable sublinear inequalities without qualifications (Q732779) (← links)
• Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991) (← links)
• Duality gap of the conic convex constrained optimization problems in normed spaces (Q1013974) (← links)
• Extended monotropic programming and duality (Q1014019) (← links)
• A note on d-stability of convex programs and limiting Lagrangians (Q1184349) (← links)
• Existence of optimal solutions and duality results under weak conditions (Q1591355) (← links)
• Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap (Q1685581) (← links)
• On the absence of duality gap for Lagrange-type functions (Q1780341) (← links)
• Duality gap in convex programming (Q1881045) (← links)
• Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
• On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization (Q2093274) (← links)
• A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints (Q2248753) (← links)
• Duality theorems for separable convex programming without qualifications (Q2359787) (← links)
• Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) (← links)
• Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications (Q2661520) (← links)
• Some robust convex programs without a duality gap (Q2841072) (← links)
• Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements (Q3225066) (← links)
• (Q3706855) (← links)
• (Q3737245) (← links)