Strong Duality in Robust Convex Programming: Complete Characterizations - researchr publication related

researchr

You are not signed in
Sign in
Sign up

V. Jeyakumar, G. Y. Li. Strong Duality in Robust Convex Programming: Complete Characterizations. SIAM Journal on Optimization, 20(6):3384-3407, 2010. [doi]

The following publications are possibly variants of this publication:

Complete characterizations of stable Farkas lemma and cone-convex programming dualityV. Jeyakumar, G. M. Lee. mp, 114(2):335-347, 2008. [doi]

The strong conical hull intersection property for convex programmingV. Jeyakumar. mp, 106(1):81-92, 2006. [doi]

On duality theory for non-convex semidefinite programmingWenyu Sun, Chengjin Li, Raimundo J. B. de Sampaio. anor, 186(1):331-343, 2011. [doi]

Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual FormulationXiaoling Sun, Duan Li. mor, 25(4):625-644, 2000. [doi]

runs on WebDSL