IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v77y2020i1d10.1007_s10589-020-00192-0.html
   My bibliography  Save this article

On the convergence of steepest descent methods for multiobjective optimization

Author

Listed:
  • G. Cocchi

    (Università di Firenze)

  • G. Liuzzi

    (Consiglio Nazionale delle Ricerche, Istituto di Analisi dei Sistemi e Informatica)

  • S. Lucidi

    (Università di Roma “Sapienza”)

  • M. Sciandrone

    (Università di Firenze)

Abstract

In this paper we consider the classical unconstrained nonlinear multiobjective optimization problem. For such a problem, it is particularly interesting to compute as many points as possible in an effort to approximate the so-called Pareto front. Consequently, to solve the problem we define an “a posteriori” algorithm whose generic iterate is represented by a set of points rather than by a single one. The proposed algorithm takes advantage of a linesearch with extrapolation along steepest descent directions with respect to (possibly not all of) the objective functions. The sequence of sets of points produced by the algorithm defines a set of “linked” sequences of points. We show that each linked sequence admits at least one limit point (not necessarily distinct from those obtained by other sequences) and that every limit point is Pareto-stationary. We also report numerical results on a collection of multiobjective problems that show efficiency of the proposed approach over more classical ones.

Suggested Citation

  • G. Cocchi & G. Liuzzi & S. Lucidi & M. Sciandrone, 2020. "On the convergence of steepest descent methods for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 77(1), pages 1-27, September.
  • Handle: RePEc:spr:coopap:v:77:y:2020:i:1:d:10.1007_s10589-020-00192-0
    DOI: 10.1007/s10589-020-00192-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-020-00192-0
    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/s10589-020-00192-0?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. G. Cocchi & G. Liuzzi & A. Papini & M. Sciandrone, 2018. "An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints," Computational Optimization and Applications, Springer, vol. 69(2), pages 267-296, March.
    2. Jörg Fliege & Benar Fux Svaiter, 2000. "Steepest descent methods for multicriteria optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 51(3), pages 479-494, August.
    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. P. Kesarwani & P. K. Shukla & J. Dutta & K. Deb, 2022. "Approximations for Pareto and Proper Pareto solutions and their KKT conditions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(1), pages 123-148, August.
    2. Matteo Lapucci & Pierluigi Mansueto, 2023. "A limited memory Quasi-Newton approach for multi-objective optimization," Computational Optimization and Applications, Springer, vol. 85(1), pages 33-73, May.

    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. Matteo Lapucci & Pierluigi Mansueto, 2023. "A limited memory Quasi-Newton approach for multi-objective optimization," Computational Optimization and Applications, Springer, vol. 85(1), pages 33-73, May.
    2. Wang Chen & Xinmin Yang & Yong Zhao, 2023. "Conditional gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 85(3), pages 857-896, July.
    3. Kazemi, Abolghasem & Moreno, Jovita & Iribarren, Diego, 2023. "Economic optimization and comparative environmental assessment of natural gas combined cycle power plants with CO2 capture," Energy, Elsevier, vol. 277(C).
    4. Ellen H. Fukuda & L. M. Graña Drummond & Fernanda M. P. Raupp, 2016. "An external penalty-type method for multicriteria," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 493-513, July.
    5. Thai Chuong, 2013. "Newton-like methods for efficient solutions in vector optimization," Computational Optimization and Applications, Springer, vol. 54(3), pages 495-516, April.
    6. Morovati, Vahid & Pourkarimi, Latif, 2019. "Extension of Zoutendijk method for solving constrained multiobjective optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 44-57.
    7. Miglierina, E. & Molho, E. & Recchioni, M.C., 2008. "Box-constrained multi-objective optimization: A gradient-like method without "a priori" scalarization," European Journal of Operational Research, Elsevier, vol. 188(3), pages 662-682, August.
    8. Erik Alex Papa Quiroz & Nancy Baygorrea Cusihuallpa & Nelson Maculan, 2020. "Inexact Proximal Point Methods for Multiobjective Quasiconvex Minimization on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 879-898, September.
    9. Kely D. V. Villacorta & Paulo R. Oliveira & Antoine Soubeyran, 2014. "A Trust-Region Method for Unconstrained Multiobjective Problems with Applications in Satisficing Processes," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 865-889, March.
    10. Kanako Mita & Ellen H. Fukuda & Nobuo Yamashita, 2019. "Nonmonotone line searches for unconstrained multiobjective optimization problems," Journal of Global Optimization, Springer, vol. 75(1), pages 63-90, September.
    11. Miglierina Enrico & Molho Elena & Recchioni Maria Cristina, 2006. "Box-constrained vector optimization: a steepest descent method without “a priori” scalarization," Economics and Quantitative Methods qf0603, Department of Economics, University of Insubria.
    12. M. L. N. Gonçalves & F. S. Lima & L. F. Prudente, 2022. "Globally convergent Newton-type methods for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 83(2), pages 403-434, November.
    13. Brian Dandurand & Margaret M. Wiecek, 2016. "Quadratic scalarization for decomposed multiobjective optimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 1071-1096, October.
    14. Gonçalves, M.L.N. & Lima, F.S. & Prudente, L.F., 2022. "A study of Liu-Storey conjugate gradient methods for vector optimization," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    15. J. Y. Bello Cruz & G. Bouza Allende, 2014. "A Steepest Descent-Like Method for Variable Order Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 371-391, August.
    16. X. M. Wang & J. H. Wang & C. Li, 2023. "Convergence of Inexact Steepest Descent Algorithm for Multiobjective Optimizations on Riemannian Manifolds Without Curvature Constraints," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 187-214, July.
    17. P. B. Assunção & O. P. Ferreira & L. F. Prudente, 2021. "Conditional gradient method for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 78(3), pages 741-768, April.
    18. Qu, Shaojian & Ji, Ying & Jiang, Jianlin & Zhang, Qingpu, 2017. "Nonmonotone gradient methods for vector optimization with a portfolio optimization application," European Journal of Operational Research, Elsevier, vol. 263(2), pages 356-366.
    19. Jean Bigeon & Sébastien Le Digabel & Ludovic Salomon, 2021. "DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization," Computational Optimization and Applications, Springer, vol. 79(2), pages 301-338, June.
    20. Suyun Liu & Luis Nunes Vicente, 2022. "Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach," Computational Management Science, Springer, vol. 19(3), pages 513-537, July.

    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:coopap:v:77:y:2020:i:1:d:10.1007_s10589-020-00192-0. 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.