IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i4p1906-1933.html

Conic Optimization with Spectral Functions on Euclidean Jordan Algebras

Author

Listed:
  • Chris Coey

    (Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142)

  • Lea Kapelevich

    (Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142)

  • Juan Pablo Vielma

    (Google Research and MIT Sloan School of Management, Cambridge, Massachusetts 02142)

Abstract

Spectral functions on Euclidean Jordan algebras arise frequently in convex optimization models. Despite the success of primal-dual conic interior point solvers, there has been little work on enabling direct support for spectral cones , that is, proper nonsymmetric cones defined from epigraphs and perspectives of spectral functions. We propose simple logarithmically homogeneous barriers for spectral cones and we derive efficient, numerically stable procedures for evaluating barrier oracles such as inverse Hessian operators. For two useful classes of spectral cones—the root-determinant cones and the matrix monotone derivative cones —we show that the barriers are self-concordant, with nearly optimal parameters. We implement these cones and oracles in our open-source solver Hypatia, and we write simple, natural formulations for four applied problems. Our computational benchmarks demonstrate that Hypatia often solves the natural formulations more efficiently than advanced solvers such as MOSEK 9 solve equivalent extended formulations written using only the cones these solvers support.

Suggested Citation

  • Chris Coey & Lea Kapelevich & Juan Pablo Vielma, 2023. "Conic Optimization with Spectral Functions on Euclidean Jordan Algebras," Mathematics of Operations Research, INFORMS, vol. 48(4), pages 1906-1933, November.
  • Handle: RePEc:inm:ormoor:v:48:y:2023:i:4:p:1906-1933
    DOI: 10.1287/moor.2022.1324
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1324
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2022.1324?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Yurii Nesterov, 2018. "Lectures on Convex Optimization," Springer Optimization and Its Applications, Springer, edition 2, number 978-3-319-91578-4, January.
    2. Yu. E. Nesterov & M. J. Todd, 1997. "Self-Scaled Barriers and Interior-Point Methods for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 1-42, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mehdi Karimi & Levent Tunçel, 2020. "Primal–Dual Interior-Point Methods for Domain-Driven Formulations," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 591-621, May.
    2. Shota Takahashi & Mituhiro Fukuda & Mirai Tanaka, 2022. "New Bregman proximal type algorithms for solving DC optimization problems," Computational Optimization and Applications, Springer, vol. 83(3), pages 893-931, December.
    3. Sangho Kum & Yongdo Lim, 2012. "A Geometric Mean of Parameterized Arithmetic and Harmonic Means of Convex Functions," Abstract and Applied Analysis, John Wiley & Sons, vol. 2012(1).
    4. A. Scagliotti & P. Colli Franzone, 2022. "A piecewise conservative method for unconstrained convex optimization," Computational Optimization and Applications, Springer, vol. 81(1), pages 251-288, January.
    5. Chee-Khian Sim, 2019. "Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence," Computational Optimization and Applications, Springer, vol. 74(2), pages 583-621, November.
    6. Fu, Hao & Lam, William H.K. & Ma, Wei & Shi, Yuxin & Jiang, Rui & Sun, Huijun & Gao, Ziyou, 2025. "Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    7. Xin Jiang & Lieven Vandenberghe, 2022. "Bregman primal–dual first-order method and application to sparse semidefinite programming," Computational Optimization and Applications, Springer, vol. 81(1), pages 127-159, January.
    8. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Other publications TiSEM 949fb20a-a2c6-4d87-85ea-8, Tilburg University, School of Economics and Management.
    9. Evren M. Turan & Johannes Jäschke & Rohit Kannan, 2025. "Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs," Computational Optimization and Applications, Springer, vol. 92(3), pages 1035-1068, December.
    10. Nesterov, Yurii & Rodomanov, Anton, 2024. "Gradient Methods for Stochastic Optimization in Relative Scale," LIDAM Discussion Papers CORE 2024027, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. Nikita Kornilov & Mohammad Alkousa & Eduard Gorbunov & Fedor Stonyakin & Pavel Dvurechensky & Alexander Gasnikov, 2025. "Intermediate Gradient Methods with Relative Inexactness," Journal of Optimization Theory and Applications, Springer, vol. 207(3), pages 1-42, December.
    12. Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
    13. Michael Orlitzky, 2021. "Gaddum’s test for symmetric cones," Journal of Global Optimization, Springer, vol. 79(4), pages 927-940, April.
    14. Felipe Lara & Raúl T. Marcavillaca & Phan Tu Vuong, 2025. "Characterizations, Dynamical Systems and Gradient Methods for Strongly Quasiconvex Functions," Journal of Optimization Theory and Applications, Springer, vol. 206(3), pages 1-25, September.
    15. B.V. Halldórsson & R.H. Tütüncü, 2003. "An Interior-Point Method for a Class of Saddle-Point Problems," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 559-590, March.
    16. G. Q. Wang & Y. Q. Bai, 2012. "A New Full Nesterov–Todd Step Primal–Dual Path-Following Interior-Point Algorithm for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 966-985, September.
    17. G. Q. Wang & L. C. Kong & J. Y. Tao & G. Lesaja, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 588-604, August.
    18. Huiyi Cao & Kamil A. Khan, 2023. "General convex relaxations of implicit functions and inverse functions," Journal of Global Optimization, Springer, vol. 86(3), pages 545-572, July.
    19. Philipp Ketz & Adam McCloskey & Jan Scherer, 2025. "Numerical Analysis of Test Optimality," Papers 2512.19843, arXiv.org.
    20. Xin Yang & Lingling Xu, 2023. "Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems," Journal of Global Optimization, Springer, vol. 87(2), pages 939-964, November.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:48:y:2023:i:4:p:1906-1933. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.