IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v190y2021i3d10.1007_s10957-021-01896-x.html
   My bibliography  Save this article

COSMO: A Conic Operator Splitting Method for Convex Conic Problems

Author

Listed:
  • Michael Garstka

    (University of Oxford)

  • Mark Cannon

    (University of Oxford)

  • Paul Goulart

    (University of Oxford)

Abstract

This paper describes the conic operator splitting method (COSMO) solver, an operator splitting algorithm and associated software package for convex optimisation problems with quadratic objective function and conic constraints. At each step, the algorithm alternates between solving a quasi-definite linear system with a constant coefficient matrix and a projection onto convex sets. The low per-iteration computational cost makes the method particularly efficient for large problems, e.g. semidefinite programs that arise in portfolio optimisation, graph theory, and robust control. Moreover, the solver uses chordal decomposition techniques and a new clique merging algorithm to effectively exploit sparsity in large, structured semidefinite programs. Numerical comparisons with other state-of-the-art solvers for a variety of benchmark problems show the effectiveness of our approach. Our Julia implementation is open source, designed to be extended and customised by the user, and is integrated into the Julia optimisation ecosystem.

Suggested Citation

  • Michael Garstka & Mark Cannon & Paul Goulart, 2021. "COSMO: A Conic Operator Splitting Method for Convex Conic Problems," Journal of Optimization Theory and Applications, Springer, vol. 190(3), pages 779-810, September.
    • Handle: RePEc:spr:joptap:v:190:y:2021:i:3:d:10.1007_s10957-021-01896-x
    DOI: 10.1007/s10957-021-01896-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-021-01896-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-021-01896-x?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    2. Hugh Everett, 1963. "Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources," Operations Research, INFORMS, vol. 11(3), pages 399-417, June.
    3. Brendan O’Donoghue & Eric Chu & Neal Parikh & Stephen Boyd, 2016. "Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 1042-1068, June.
    4. Goran Banjac & Paul Goulart & Bartolomeo Stellato & Stephen Boyd, 2019. "Infeasibility Detection in the Alternating Direction Method of Multipliers for Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 183(2), pages 490-519, November.
    5. Stephen Boyd & Enzo Busseti & Steven Diamond & Ronald N. Kahn & Kwangmoo Koh & Peter Nystrup & Jan Speth, 2017. "Multi-Period Trading via Convex Optimization," Papers 1705.00109, arXiv.org.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cheng Lu & Zhibin Deng & Shu-Cherng Fang & Wenxun Xing, 2023. "A New Global Algorithm for Max-Cut Problem with Chordal Sparsity," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 608-638, May.
    2. Nikitas Rontsis & Paul Goulart & Yuji Nakatsukasa, 2022. "Efficient Semidefinite Programming with Approximate ADMM," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 292-320, January.

    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. Nikitas Rontsis & Paul Goulart & Yuji Nakatsukasa, 2022. "Efficient Semidefinite Programming with Approximate ADMM," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 292-320, January.
    2. Nicholas Moehle & Mykel J. Kochenderfer & Stephen Boyd & Andrew Ang, 2021. "Tax-Aware Portfolio Construction via Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 189(2), pages 364-383, May.
    3. Guillermo Angeris & Akshay Agrawal & Alex Evans & Tarun Chitra & Stephen Boyd, 2021. "Constant Function Market Makers: Multi-Asset Trades via Convex Optimization," Papers 2107.12484, arXiv.org.
    4. Enzo Busseti & Walaa M. Moursi & Stephen Boyd, 2019. "Solution refinement at regular points of conic problems," Computational Optimization and Applications, Springer, vol. 74(3), pages 627-643, December.
    5. Alberto Marchi, 2022. "On a primal-dual Newton proximal method for convex quadratic programs," Computational Optimization and Applications, Springer, vol. 81(2), pages 369-395, March.
    6. Estévez-Fernández, Arantza, 2012. "A game theoretical approach to sharing penalties and rewards in projects," European Journal of Operational Research, Elsevier, vol. 216(3), pages 647-657.
    7. Alparslan-Gok, S.Z. & Brânzei, R. & Tijs, S.H., 2008. "Cooperative Interval Games Arising from Airport Situations with Interval Data," Other publications TiSEM 5ded50b5-2a11-4d25-8511-b, Tilburg University, School of Economics and Management.
    8. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    9. Giulia Cesari & Roberto Lucchetti & Stefano Moretti, 2017. "Generalized additive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 919-939, November.
    10. Andrew Butler & Roy H. Kwon, 2023. "Efficient differentiable quadratic programming layers: an ADMM approach," Computational Optimization and Applications, Springer, vol. 84(2), pages 449-476, March.
    11. Xiaoyue Li & A. Sinem Uysal & John M. Mulvey, 2021. "Multi-Period Portfolio Optimization using Model Predictive Control with Mean-Variance and Risk Parity Frameworks," Papers 2103.10813, arXiv.org.
    12. van Beek, Andries & Malmberg, Benjamin & Borm, Peter & Quant, Marieke & Schouten, Jop, 2021. "Cooperation and Competition in Linear Production and Sequencing Processes," Discussion Paper 2021-011, Tilburg University, Center for Economic Research.
    13. Mustafa Doğru & A. Kok & G. Houtum, 2013. "Newsvendor characterizations for one-warehouse multi-retailer inventory systems with discrete demand under the balance assumption," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 541-559, September.
    14. Enzo Busseti, 2019. "Derivative of a Conic Problem with a Unique Solution," Papers 1903.05753, arXiv.org, revised Mar 2019.
    15. Thijssen, J.J.J., 2003. "Investment under uncertainty, market evolution and coalition spillovers in a game theoretic perspective," Other publications TiSEM 672073a6-492e-4621-8d4a-0, Tilburg University, School of Economics and Management.
    16. Grundel, S. & Borm, P.E.M. & Hamers, H.J.M., 2011. "A Compromise Stable Extension of Bankruptcy Games : Multipurpose Resource Allocation," Discussion Paper 2011-029, Tilburg University, Center for Economic Research.
    17. da Costa, B. Freitas Paulo & Pesenti, Silvana M. & Targino, Rodrigo S., 2023. "Risk budgeting portfolios from simulations," European Journal of Operational Research, Elsevier, vol. 311(3), pages 1040-1056.
    18. Bernardo Freitas Paulo da Costa & Silvana M. Pesenti & Rodrigo S. Targino, 2023. "Risk Budgeting Portfolios from Simulations," Papers 2302.01196, arXiv.org.
    19. Barış Bülent Kırlar & Serap Ergün & Sırma Zeynep Alparslan Gök & Gerhard-Wilhelm Weber, 2018. "A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects," Annals of Operations Research, Springer, vol. 260(1), pages 217-231, January.
    20. Alparslan-Gok, S.Z. & Miquel, S. & Tijs, S.H., 2008. "Cooperation under Interval Uncertainty," Other publications TiSEM 9a01bd57-964d-4e71-8508-7, Tilburg University, School of Economics and Management.

    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:spr:joptap:v:190:y:2021:i:3:d:10.1007_s10957-021-01896-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.