Pages that link to "Item:Q3220380"

The following pages link to Closedness conditions for the optimality of a family of non-convex optimization problems (Q3220380):

Displaying 12 items.

• New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
• Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700) (← links)
• Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159) (← links)
• \(\varepsilon\)-optimality conditions for composed convex optimization problems (Q935086) (← links)
• An application of the bivariate inf-convolution formula to enlargements of monotone operators (Q1005152) (← links)
• A note on d-stability of convex programs and limiting Lagrangians (Q1184349) (← links)
• Infinite-dimensional convex programming with applications to constrained approximation (Q1321276) (← links)
• Convex functions with continuous epigraph or continuous level sets (Q1908635) (← links)
• Optimality conditions in convex multiobjective SIP (Q2364489) (← links)
• A dual criterion for maximal monotonicity of composition operators (Q2460925) (← links)
• Necessary and sufficient conditions for stable conjugate duality (Q2492483) (← links)
• Relationships Between Farthest Point Problem and Best Approximation Problem (Q3007937) (← links)