On the approximability of adjustable robust convex optimization under uncertainty

ISSN： 1432-2994

Source： Mathematical Methods of Operations Research, Vol.77, Iss.3, 2013-06, pp. : 323-343

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Cutting plane algorithms for robust conic convex optimization problems

By Gomez J. Gomez W.

Optimization Methods and Software, Vol. 21, Iss. 5, 2006-10 ,pp. : 779-803

Taylor & Francis Ltd

Access to resources Recommend Favorite

Cutting-set methods for robust convex optimization with pessimizing oracles

By Mutapcic Almir Boyd Stephen

Optimization Methods and Software, Vol. 24, Iss. 3, 2009-06 ,pp. : 381-406

Taylor & Francis Ltd

Access to resources Recommend Favorite

Nonlinear robust optimization via sequential convex bilevel programming

By Houska Boris Diehl Moritz

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 539-577

Elsevier

Access to resources Recommend Favorite

Semi-Infinite Optimization under Convex Function Perturbations: Lipschitz Stability

By Huy N. Yao J.-C.

Journal of Optimization Theory and Applications, Vol. 148, Iss. 2, 2011-02 ,pp. : 237-256

Springer Publishing Company

Access to resources Recommend Favorite

Strong duality in robust semi-definite linear programming under data uncertainty

By Jeyakumar V. Li G.Y.

Optimization, Vol. 63, Iss. 5, 2014-05 ,pp. : 713-733

Taylor & Francis Ltd

Access to resources Recommend Favorite