Ellipsoidal cones are more general than revolution cones but they still have a simple structure. Such a compromise between simplicity and sufficient degree of generality make them very useful in practice. Ellipsoidal cones have applications in optimization, statistics, control of linear dynamical systems, and in many other fields. The purpose of this survey paper is to gather in a single place a rich variety of results on ellipsoidal cones disseminated in the literature. A few selected examples of applications are provided to show the importance of this particular class of convex cones.

Contact details are reproduced from the original publication and may be historical.

  1. A. M. Aliliuko, O. H. Mazko: Invariant cones and stability of linear dynamical systems, Ukranian Math. J. 58 (2006) 1635–1655.https://doi.org/10.1007/s11253-006-0159-5Google Scholar
  2. D. Amelunxen, M. Lotz, M. B. Mccoy, J. A. Tropp: Living on the edge: Phase transitions in convex programs with random data, Inform. Inference 3 (2015) 224–294.https://doi.org/10.1093/imaiai/iau005Google Scholar
  3. A. Belloni, R. M. Freund: On the second-order feasibility cone: primal-dual representation and efficient projection, SIAM J. Optim. 19 (2008) 1073–1092.https://doi.org/10.1137/06067198XGoogle Scholar
  4. A. Berman, M. Neuman, R. J. Stern: Nonnegative Matrices in Dynamics Systems, Wiley, New York (1989).Google Scholar
  5. R. Bhattacharya, J. Fung, R. M. Murray, A. Tiwari: Ellipsoidal cones and rendezvous of multiple agents, in: 43rd IEEE Conf. on Decision and Control, Nassau, Bahamas (2004).https://doi.org/10.1109/CDC.2004.1428625Google Scholar
  6. W. Blaschke: Vorlesungen über Differentialgeometrie II, Springer, Berlin (1923).https://doi.org/10.1007/978-3-662-42944-0Google Scholar
  7. G. C. Calafiori: Approximation of n-dimensional data using spherical and ellipsoidal primitives, IEEE Trans. Systems, Man, Cybernetics 32 (2002) 269–278.https://doi.org/10.1109/TSMCA.2002.1021114Google Scholar
  8. B. C. Carlson: Some inequalities for hypergeometric functions, Proc. Amer. Math. Soc. 17 (1966) 32–39.https://doi.org/10.1090/S0002-9939-1966-0188497-6Google Scholar
  9. C. B. Chua: The primal-dual second-order cone approximations algorithm for symmetric cone programming, Found. Comput. Math. 7 (2007) 271–302.https://doi.org/10.1007/s10208-004-0149-7Google Scholar
  10. F. H. Clarke, Y. S. Ledyaev, R. J. Stern: Complements, approximations, smoothings and invariance properties, J. Convex Analysis 4 (1997) 189–219.https://doi.org/10.68381/jca04010Google Scholar
  11. F. H. Clarke, Y. S. Ledyaev, R. J. Stern: Invariance, monotonicity, and applications, in: Nonlinear Analysis, Differential Equations and Control, NATO Sci. Ser. C Math. Phys. Sci. 528, Kluwer Academic Publishers, Dordrecht (1999) 207–305.https://doi.org/10.1007/978-94-011-4560-2_4Google Scholar
  12. G. Eichfelder, J. Povh: On the set-semidefinite representation of nonconvex quadratic programs with cone constraints, Croat. Oper. Res. Rev. CRORR 1 (2010) 26–39.Google Scholar
  13. F. Facchinei, J. S. Pang: Finite Dimensional Variational Inequalities I, Springer, New York (2003).Google Scholar
  14. J. Faraut, A. Korányi: Analysis on Symmetric Cones, Oxford University Press, New York (1994).https://doi.org/10.1093/oso/9780198534778.001.0001Google Scholar
  15. M. Fiedler, E. Haynsworth: Cones which are topheavy with respect to a norm, Linear Multilinear Algebra 1 (1973) 203–211.https://doi.org/10.1080/03081087308817019Google Scholar
  16. D. D. Fischer: Minimum ellipsoids, Math. Comput. 18 (1964) 669–673.https://doi.org/10.1090/S0025-5718-1964-0166905-0Google Scholar
  17. R. M. Freund, J. R. Vera: Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm, SIAM J. Optim. 10 (1999) 155–176.https://doi.org/10.1137/S105262349732829XGoogle Scholar
  18. S. Gigena: Integral invariants of convex cones, J. Differential Geometry 13 (1978) 191–222.https://doi.org/10.4310/jdg/1214434486Google Scholar
  19. J.-L. Goffin: The relaxation method for solving systems of linear inequalities, Math. Oper. Res. 5 (1980) 388–414.https://doi.org/10.1287/moor.5.3.388Google Scholar
  20. D. Gourion, A. Seeger: Deterministic and stochastic methods for computing volumetric moduli of convex cones, Comput. Appl. Math. 29 (2010) 215–246.https://doi.org/10.1590/S1807-03022010000200007Google Scholar
  21. D. Gourion, A. Seeger: Solidity indices for convex cones, Positivity 16 (2012) 685–705.https://doi.org/10.1007/s11117-011-0140-xGoogle Scholar
  22. M. S. Gowda, J. Tao: On the bilinearity rank of a proper cone and Lyapunov-like transformations, Math. Program. 147 (2014) 155–170.https://doi.org/10.1007/s10107-013-0715-3Google Scholar
  23. M. S. Gowda, D. Trott: On the irreducibility, Lyapunov rank, and automorphisms of special Bishop-Phelps cones, J. Math. Anal. Appl. 419 (2014) 172–184.https://doi.org/10.1016/j.jmaa.2014.04.061Google Scholar
  24. P. M. Gruber, T. Ódor: Ellipsoids are the most symmetric convex bodies, Arch. Math. (Basel) 73 (1999) 394–400.https://doi.org/10.1007/s000130050414Google Scholar
  25. C. Grussler, A. Rantzig: Modified balanced truncation preserving ellipsoidal cone-invariance, in: 53rd IEEE Conference on Decision and Control, Los Angeles (2014) 2365–2370.https://doi.org/10.1109/CDC.2014.7039749Google Scholar
  26. O. Güler: Barrier functions in interior point methods, Math. Oper. Res. 21 (1996) 860–885.https://doi.org/10.1287/moor.21.4.860Google Scholar
  27. X. L. Guo, Z. B. Deng, S. C. Fang, Z. B. Wang, W. X. Xing: Quadratic optimization over a second-order cone with linear equality constraints, J. Oper. Res. Soc. China 2 (2014) 17–38.https://doi.org/10.1007/s40305-013-0035-6Google Scholar
  28. R. Henrion, A. Seeger: On properties of different notions of centers for convex cones, Set-Valued Variat. Analysis 18 (2010) 205–231.https://doi.org/10.1007/s11228-009-0131-2Google Scholar
  29. R. Henrion, A. Seeger: Inradius and circumradius of various convex cones arising in applications, Set-Valued Variat. Analysis 18 (2010) 483–511.https://doi.org/10.1007/s11228-010-0150-zGoogle Scholar
  30. R. Henrion, A. Seeger: Condition number and eccentricity of a closed convex cone, Math. Scandinavica 109 (2011) 285–308.https://doi.org/10.7146/math.scand.a-15190Google Scholar
  31. M. Ito, B. F. Lourenço: The p-cones in dimension n ≥ 3 are not homogeneous when p ≠ 2, Linear Algebra Appl. 533 (2017) 326–335.https://doi.org/10.1016/j.laa.2017.07.029Google Scholar
  32. A. Iusem, A. Seeger: Axiomatization of the index of pointedness for closed convex cones, Comput. Appl. Math. 24 (2005) 245–283.https://doi.org/10.1590/S0101-82052005000200006Google Scholar
  33. A. Iusem, A. Seeger: On pairs of vectors achieving the maximal angle of a convex cone, Math. Progr. 104 (2005) 501–523.https://doi.org/10.1007/s10107-005-0626-zGoogle Scholar
  34. A. Iusem, A. Seeger: Measuring the degree of pointedness of a closed convex cone: a metric approach, Math. Nachrichten 279 (2006) 599–618.https://doi.org/10.1002/mana.200310380Google Scholar
  35. A. Iusem, A. Seeger: Angular analysis of two classes of non-polyhedral convex cones: the point of view of optimization theory, Comput. Appl. Math. 26 (2007) 191–214.https://doi.org/10.1590/S0101-82052007000200002Google Scholar
  36. A. Iusem, A. Seeger: Searching for critical angles in a convex cone, Math. Progr. 120 (2009) 3–25.https://doi.org/10.1007/s10107-007-0146-0Google Scholar
  37. J. Jahn: Bishop-Phelps cones in optimization, Int. J. Optim. Theory Methods Appl. 1 (2009) 123–139.Google Scholar
  38. J. Jerónimo-Castro, T. B. Mcallister: Two characterizations of ellipsoidal cones, J. Convex Analysis 20 (2013) 1181–1187.https://doi.org/10.68381/jca20063Google Scholar
  39. M. Lemmon: Inductive inference of invariant subspaces, in: Proc. American Control Conf., San Francisco (1993) 1219–1223.https://doi.org/10.23919/ACC.1993.4793062Google Scholar
  40. R. Loewy, H. Schneider: Positive operators on the n-dimensional ice cream cone, J. Math. Anal. Appl. 49 (1975) 375–392.https://doi.org/10.1016/0022-247X(75)90186-9Google Scholar
  41. S. Olovjanischnikoff: Über eine kennzeichnende Eigenschaft des Ellipsoides, Uchenye Zapiski Leningrad State Univ., Math. Series 83 (1941) 114–128.Google Scholar
  42. J. Peña, J. Renegar: Computing approximate solutions for convex conic systems of constraints, Math. Program. 87 (2000) 351–383.https://doi.org/10.1007/s101070050001Google Scholar
  43. J. Ribando: Measuring solid angles beyond dimension three, Discrete Comput. Geom. 36 (2006) 479–487.https://doi.org/10.1007/s00454-006-1253-4Google Scholar
  44. G. Rudolf, N. Noyan, D. Papp, F. Alizadeh: Bilinear optimality constraints for the cone of positive polynomials, Math. Program. 129 (2011) 5–31.https://doi.org/10.1007/s10107-011-0458-yGoogle Scholar
  45. L. A. Santaló: Un invariante afin para los cuerpos convexos del espacio de n dimensiones, Portugal Math. 8 (1949) 155–161.Google Scholar
  46. H. Schneider, M. Vidyasagar: Cross-positive matrices, SIAM J. Numer. Anal. 7 (1970) 508–519.https://doi.org/10.1137/0707041Google Scholar
  47. A. Seeger: Epigraphical cones I, J. Convex Analysis 18 (2011) 1171–1196.https://doi.org/10.68381/jca18070Google Scholar
  48. A. Seeger: Epigraphical cones II, J. Convex Analysis 19 (2012) 1–21.https://doi.org/10.68381/jca19001Google Scholar
  49. A. Seeger: Aperture angle analysis for ellipsoids, Electronic J. Linear Algebra 26 (2013) 732–741.https://doi.org/10.13001/1081-3810.1683Google Scholar
  50. A. Seeger: On measures of size for convex cones, J. Convex Analysis 23 (2016) 947–980.https://doi.org/10.68381/jca23036Google Scholar
  51. A. Seeger, D. Sossa: Critical angles between two convex cones. II: Special cases, TOP 24 (2016) 66–87.https://doi.org/10.1007/s11750-015-0382-zGoogle Scholar
  52. A. Seeger, M. Torki: Centers and partial volumes of convex cones. I: Basic theory, Beitr. Algebra Geom. 56 (2015) 227–248.https://doi.org/10.1007/s13366-014-0220-8Google Scholar
  53. A. Seeger, M. Torki: Centers and partial volumes of convex cones. II: Advanced topics, Beitr. Algebra Geom. 56 (2015) 491–514.https://doi.org/10.1007/s13366-014-0221-7Google Scholar
  54. A. Seeger, M. Torki: Conic version of Loewner-John ellipsoid theorem, Math. Program. 155 (2016) 403–433.https://doi.org/10.1007/s10107-014-0852-3Google Scholar
  55. A. Seeger, M. Torki: Inscribed and circumscribed ellipsoidal cones: volume ratio analysis, Beitr. Algebra Geom. 59 (2018) 717–737.https://doi.org/10.1007/s13366-018-0387-5Google Scholar
  56. A. Seeger, J. Vidal-Nuñez: Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach, J. Global Optim. 68 (2017) 279–306.https://doi.org/10.1007/s10898-016-0464-yGoogle Scholar
  57. C. Shannon: Probability of error for optimal codes in a Gaussian channel, Bell System Tech. 38 (1959) 611–656.https://doi.org/10.1002/j.1538-7305.1959.tb03905.xGoogle Scholar
  58. R. Stern, H. Wolkowicz: Invariant ellipsoidal cones, Linear Algebra Appl. 150 (1991) 81–106.https://doi.org/10.1016/0024-3795(91)90161-OGoogle Scholar
  59. R. Stern, H. Wolkowicz: Exponential nonnegativity on the ice cream cone, SIAM J. Matrix Anal. Appl. 12 (1991) 160–165.https://doi.org/10.1137/0612012Google Scholar
  60. G. J. Tee: Surface area and capacity of ellipsoids in n dimensions, New Zealand J. Math. 34 (2005) 165–198.Google Scholar
  61. Y. Tian, S. C. Fang, Z. B. Deng, W. X. Xing: Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its applications to completely positive programming, J. Indust. Manag. Optim. 9 (2013) 703–721.https://doi.org/10.3934/jimo.2013.9.703Google Scholar