Pages that link to "Item:Q837124"

The following pages link to Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124):

Displaying 16 items.

• Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality (Q352746) (← links)
• A complete characterization of strong duality in nonconvex optimization with a single constraint (Q454276) (← links)
• A note on nonconvex minimax theorem with separable homogeneous polynomials (Q637566) (← links)
• On epsilon-stability in optimization (Q684048) (← links)
• Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap (Q1685581) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
• Min-sup-type zero duality gap properties for DC composite optimization problem (Q2067945) (← links)
• A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints (Q2248753) (← links)
• Exact relaxations for parametric robust linear optimization problems (Q2294277) (← links)
• Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) (← links)
• Convexity and closedness in stable robust duality (Q2414114) (← links)
• Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems (Q2440517) (← links)
• Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements (Q3225066) (← links)
• Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems (Q3298015) (← links)
• On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← links)