IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i4p1906-1933.html
   My bibliography  Save this article

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
    ---><---

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.