IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v70y2018i3d10.1007_s10898-017-0571-4.html
   My bibliography  Save this article

A Frank–Wolfe based branch-and-bound algorithm for mean-risk optimization

Author

Listed:
  • Christoph Buchheim

    (TU Dortmund)

  • Marianna De Santis

    (Università di Roma “La Sapienza”)

  • Francesco Rinaldi

    (Università di Padova)

  • Long Trieu

    (TU Dortmund)

Abstract

We present an exact algorithm for mean-risk optimization subject to a budget constraint, where decision variables may be continuous or integer. The risk is measured by the covariance matrix and weighted by an arbitrary monotone function, which allows to model risk-aversion in a very individual way. We address this class of convex mixed-integer minimization problems by designing a branch-and-bound algorithm, where at each node, the continuous relaxation is solved by a non-monotone Frank–Wolfe type algorithm with away-steps. Experimental results on portfolio optimization problems show that our approach can outperform the MISOCP solver of CPLEX 12.6 for instances where a linear risk-weighting function is considered.

Suggested Citation

  • Christoph Buchheim & Marianna De Santis & Francesco Rinaldi & Long Trieu, 2018. "A Frank–Wolfe based branch-and-bound algorithm for mean-risk optimization," Journal of Global Optimization, Springer, vol. 70(3), pages 625-644, March.
    • Handle: RePEc:spr:jglopt:v:70:y:2018:i:3:d:10.1007_s10898-017-0571-4
    DOI: 10.1007/s10898-017-0571-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-017-0571-4
    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/s10898-017-0571-4?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. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2013. "A new method for mean-variance portfolio optimization with cardinality constraints," Annals of Operations Research, Springer, vol. 205(1), pages 213-234, May.
    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. Unai Aldasoro & María Merino & Gloria Pérez, 2019. "Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic," Annals of Operations Research, Springer, vol. 280(1), pages 151-187, September.
    2. Lorenz M. Roebers & Aras Selvi & Juan C. Vera, 2018. "Using Column Generation to Solve Extensions to the Markowitz Model," Papers 1812.00093, arXiv.org, revised Jun 2019.
    3. Justo Puerto & Moises Rodr'iguez-Madrena & Andrea Scozzari, 2019. "Location and portfolio selection problems: A unified framework," Papers 1907.07101, arXiv.org.
    4. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2015. "Linear vs. quadratic portfolio selection models with hard real-world constraints," Computational Management Science, Springer, vol. 12(3), pages 345-370, July.
    5. N. Krejić & E. H. M. Krulikovski & M. Raydan, 2023. "A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization," SN Operations Research Forum, Springer, vol. 4(4), pages 1-24, December.
    6. Alessandra Carleo & Francesco Cesarone & Andrea Gheno & Jacopo Maria Ricci, 2017. "Approximating exact expected utility via portfolio efficient frontiers," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 40(1), pages 115-143, November.
    7. Renato Bruni & Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2013. "No arbitrage and a linear portfolio selection model," Economics Bulletin, AccessEcon, vol. 33(2), pages 1247-1258.
    8. Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz, 2018. "Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization," Computational Optimization and Applications, Springer, vol. 70(2), pages 503-530, June.
    9. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2020. "An optimization–diversification approach to portfolio selection," Journal of Global Optimization, Springer, vol. 76(2), pages 245-265, February.
    10. Stefania Corsaro & Valentina Simone, 2019. "Adaptive $$l_1$$ l 1 -regularization for short-selling control in portfolio selection," Computational Optimization and Applications, Springer, vol. 72(2), pages 457-478, March.
    11. Nasim Dehghan Hardoroudi & Abolfazl Keshvari & Markku Kallio & Pekka Korhonen, 2017. "Solving cardinality constrained mean-variance portfolio problems via MILP," Annals of Operations Research, Springer, vol. 254(1), pages 47-59, July.
    12. Bruni, Renato & Cesarone, Francesco & Scozzari, Andrea & Tardella, Fabio, 2017. "On exact and approximate stochastic dominance strategies for portfolio selection," European Journal of Operational Research, Elsevier, vol. 259(1), pages 322-329.
    13. Kocherlakota Satya Pritam & Trilok Mathur & Shivi Agarwal & Sanjoy Kumar Paul & Ahmed Mulla, 2022. "A novel methodology for perception-based portfolio management," Annals of Operations Research, Springer, vol. 315(2), pages 1107-1133, August.
    14. Gian Paolo Clemente & Rosanna Grassi & Asmerilda Hitaj, 2018. "Asset allocation: new evidence through network approaches," Papers 1810.09825, arXiv.org.
    15. Lampariello, Lorenzo & Neumann, Christoph & Ricci, Jacopo M. & Sagratella, Simone & Stein, Oliver, 2021. "Equilibrium selection for multi-portfolio optimization," European Journal of Operational Research, Elsevier, vol. 295(1), pages 363-373.
    16. Akhter Mohiuddin Rather & V. N. Sastry & Arun Agarwal, 2017. "Stock market prediction and Portfolio selection models: a survey," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 558-579, September.
    17. Salo, Ahti & Doumpos, Michalis & Liesiö, Juuso & Zopounidis, Constantin, 2024. "Fifty years of portfolio optimization," European Journal of Operational Research, Elsevier, vol. 318(1), pages 1-18.
    18. Doering, Jana & Kizys, Renatas & Juan, Angel A. & Fitó, Àngels & Polat, Onur, 2019. "Metaheuristics for rich portfolio optimisation and risk management: Current state and future trends," Operations Research Perspectives, Elsevier, vol. 6(C).
    19. Lu Wang & Ferhana Ahmad & Gong-li Luo & Muhammad Umar & Dervis Kirikkaleli, 2022. "Portfolio optimization of financial commodities with energy futures," Annals of Operations Research, Springer, vol. 313(1), pages 401-439, June.
    20. Fereshteh Vaezi & Seyed Jafar Sadjadi & Ahmad Makui, 2019. "A portfolio selection model based on the knapsack problem under uncertainty," PLOS ONE, Public Library of Science, vol. 14(5), pages 1-19, May.

    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:jglopt:v:70:y:2018:i:3:d:10.1007_s10898-017-0571-4. 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.