New strong duality results for convex programs with separable constraints
暂无分享,去创建一个
[1] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[2] C. Zălinescu. Convex analysis in general vector spaces , 2002 .
[3] Laurent El Ghaoui,et al. Robust Optimization , 2021, ICORES.
[4] Surjeet Kaur Suneja,et al. Convex programming with single separable constraint and bounded variables , 2007, Comput. Optim. Appl..
[5] S. Stefanov. Separable Programming - Theory and Methods , 2001 .
[6] Paul Tseng. Some convex programs without a duality gap , 2009, Math. Program..
[7] E. G. Golʹshteĭn. Theory of convex programming , 1972 .
[8] Vaithilingam Jeyakumar,et al. Characterizing robust set containments and solutions of uncertain linear programs without qualifications , 2010, Oper. Res. Lett..
[9] Vaithilingam Jeyakumar,et al. New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs , 2003, SIAM J. Optim..
[10] Vaithilingam Jeyakumar. Constraint Qualifications Characterizing Lagrangian Duality in Convex Optimization , 2008 .
[11] Marco A. López,et al. Linear semi-infinite programming theory: An updated survey , 2002, Eur. J. Oper. Res..
[12] Liu Guoyin,et al. On Extension of Fenchel Duality and its Application , 2008 .
[13] Stefan M. Stefanov. Convex Separable Programming , 2001 .
[14] V. Jeyakumar,et al. Qualification-Free Optimality Conditions for Convex Programs with Separable Inequality Constraints∗ , 2009 .
[15] V. Jeyakumar,et al. A Dual Condition for the Convex Subdifferential Sum Formula with Applications , 2022 .
[16] Dimitri P. Bertsekas,et al. Convex Analysis and Optimization , 2003 .