Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming

References

• Ahipaşaoğlu SD (2015) Fast algorithms for the minimum volume estimator. J. Global Optim. 62(2):351–370.Crossref, Google Scholar
• Anstreicher KM (2009) Semidefinite programming vs. the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43(2-3):471–484.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (2001) Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, vol. 2 (SIAM, Philadelphia).Crossref, Google Scholar
• Ben-Tal A, Nemirovski A, Roos C (2002) Robust solutions of uncertain quadratic and conic-quadratic problems. SIAM J. Optim. 13(2):535–560.Crossref, Google Scholar
• Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming A 99(2):351–376.Crossref, Google Scholar
• Bertsimas D, Dunning I (2016) Multistage robust mixed-integer optimization with adaptive partitions. Oper. Res. 64(4):980–998.Link, Google Scholar
• Bertsimas D, Doan XV, Natarajan K, Teo C-P (2010) Models for minimax stochastic linear optimization problems with risk aversion. Math. Oper. Res. 35(3):580–602.Link, Google Scholar
• Bomze IM (2012) Copositive optimization–recent developments and applications. Eur. J. Oper. Res. 216(3):509–520.Crossref, Google Scholar
• Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, United Kingdom).Crossref, Google Scholar
• Boyd S, El Ghaoui L, Feron E, Balakrishnan V (1994) Linear Matrix Inequalities in System and Control Theory, vol. 15 (SIAM, Philadelphia).Crossref, Google Scholar
• Burer S (2012) Copositive programming. Anjos M, Lasserre J, eds. Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research & Management Science, vol. 166 (Springer, Boston), 201–218.Crossref, Google Scholar
• Burer S, Anstreicher KM (2013) Second-order-cone constraints for extended trust-region subproblems. SIAM J. Optim. 23(1):432–451.Crossref, Google Scholar
• Burer S, Dong H (2012) Representing quadratically constrained quadratic programs as generalized copositive programs. Oper. Res. Lett. 40(3):203–206.Crossref, Google Scholar
• Calafiore G, El Ghaoui L (2004) Ellipsoidal bounds for uncertain linear equations and dynamical systems. Automatica J. IFAC 40(5):773–787.Crossref, Google Scholar
• Eberly DH (2001) 3D Game Engine Design (Kaufmann, San Francisco).Google Scholar
• Elzinga J, Hearn D (1974) The minimum sphere covering a convex polyhedron. Naval Res. Logist. 21(4):715–718.Crossref, Google Scholar
• Freund RM, Orlin JB (1985) On the complexity of four polyhedral set containment problems. Math. Programming 33(2):139–145.Crossref, Google Scholar
• Glineur F (1998) Pattern Separation via Ellipsoids and Conic Programming (Mémoire de DEA, Faculté Polytechnique de Mons, Mons, Belgium).Google Scholar
• Gotoh J, Konno H (2006) Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. J. Global Optim. 34(1):1–14.Crossref, Google Scholar
• Hanasusanto GA, Kuhn D (2018) Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls. Oper. Res. 66(3):849–869.Link, Google Scholar
• Hanasusanto GA, Kuhn D, Wallace SW, Zymler S (2015) Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Math. Programming 152(1-2):1–32.Crossref, Google Scholar
• Helton JW, Klep I, McCullough S (2013) The matricial relaxation of a linear matrix inequality. Math. Programming 138(1-2):401–445.Crossref, Google Scholar
• Henk M (2012) Löwner-John ellipsoids. Documenta Mathematica 17(2012):95–106.Google Scholar
• Horn RA, Johnson CR (1990) Matrix Analysis (Cambridge University Press, Cambridge, United Kingdom).Google Scholar
• John F (2014) Extremum problems with inequalities as subsidiary conditions. Giorgi G, Kjeldsen T, eds. Traces and Emergence of Nonlinear Programming (Birkhäuser, Basel, Switzerland), 197–215.Crossref, Google Scholar
• Kellner K, Theobald T, Trabandt C (2013) Containment problems for polytopes and spectrahedra. SIAM J. Optim. 23(2):1000–1020.Crossref, Google Scholar
• Khachiyan LG (1996) Rounding of polytopes in the real number model of computation. Math. Oper. Res. 21(2):307–320.Link, Google Scholar
• Khachiyan LG, Todd MJ (1993) On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math. Programming 61(1):137–159.Crossref, Google Scholar
• Kurzhanskiĭ AB, Vályi I (1997) Ellipsoidal Calculus for Estimation and Control (Birkhäuser, Basel, Switzerland).Crossref, Google Scholar
• Lasserre JB (2001) Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3):796–817.Crossref, Google Scholar
• Löfberg J (2004) YALMIP: A toolbox for modeling and optimization in MATLAB. IEEE Internat. Sympos. Comput. Aided Control Systems Design, 284–289.Google Scholar
• Mittal A, Gokalp C, Hanasusanto GA (2020) Robust quadratic programming with mixed-integer uncertainty. INFORMS J. Comput. 32(2):201–218.Abstract, Google Scholar
• Natarajan K, Pachamanova D, Sim M (2009) Constructing risk measures from uncertainty sets. Oper. Res. 57(5):1129–1141.Link, Google Scholar
• Natarajan K, Teo C-P, Zheng Z (2011) Mixed 0-1 linear programs under objective uncertainty: A completely positive representation. Oper. Res. 59(3):713–728.Link, Google Scholar
• Parrilo PA (2000) Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology, Pasadena, CA.Google Scholar
• Prasad MN, Hanasusanto GA (2018) Improved conic reformulations for k-means clustering. SIAM J. Optim. 28(4):3105–3126.Crossref, Google Scholar
• Rimon E, Boyd S (1997) Obstacle collision detection using best ellipsoid fit. J. Intelligent Robotic Systems 18(2):105–126.Crossref, Google Scholar
• Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J. Risk 2(3):21–41.Crossref, Google Scholar
• Shapiro A, Kleywegt A (2002) Minimax analysis of stochastic problems. Optim. Methods Software 17(3):523–542.Crossref, Google Scholar
• Sherali HD, Adams WP (2013) A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31 (Springer Science & Business Media, Boston).Google Scholar
• Silverman BW, Titterington DM (1980) Minimum covering ellipses. SIAM J. Sci. Statist. Comput. 1(4):401–409.Crossref, Google Scholar
• Sturm JF, Zhang S (2003) On cones of nonnegative quadratic functions. Math. Oper. Res. 28(2):246–267.Link, Google Scholar
• Sun P, Freund RM (2004) Computation of minimum-volume covering ellipsoids. Oper. Res. 52(5):690–706.Link, Google Scholar
• Todd MJ (2016) Minimum-Volume Ellipsoids: Theory and Algorithms (SIAM, Philadelphia).Crossref, Google Scholar
• Xu G, Burer S (2018) A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. Comput. Optim. Appl. 70(1):33–59.Crossref, Google Scholar
• Yildirim EA (2006) On the minimum volume covering ellipsoid of ellipsoids. SIAM J. Optim. 17(3):621–641.Crossref, Google Scholar
• Zhen J, de Ruiter FJCT, Roos E, den Hertog D (2021) Robust optimization for models with uncertain second-order cone and semidefinite programming constraints. INFORMS J. Comput., ePub ahead of print March 23, https://doi.org/10.1287/ijoc.2020.1025.Google Scholar
• Zhu S, Fukushima M (2009) Worst-case conditional value-at-risk with application to robust portfolio management. Oper. Res. 57(5):1155–1168.Link, Google Scholar
• Zuluaga LF, Vera J, Peña J (2006) LMI approximations for cones of positive semidefinite forms. SIAM J. Optim. 16(4):1076–1091.Crossref, Google Scholar