IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v443y2023ics0096300322008591.html
   My bibliography  Save this article

Memory gradient method for multiobjective optimization

Author

Listed:
  • Chen, Wang
  • Yang, Xinmin
  • Zhao, Yong

Abstract

In this paper, we propose a new descent method, called multiobjective memory gradient method, for finding Pareto critical points of a multiobjective optimization problem. The main thought in this method is to select a combination of the current descent direction and past multi-step iterative information as a new search direction and to obtain a stepsize by two types of strategies. It is proved that the developed direction with suitable parameters always satisfies the sufficient descent condition at each iteration. Based on mild assumptions, we obtain the global convergence and the rates of convergence for our method. Computational experiments are given to demonstrate the effectiveness of the proposed method.

Suggested Citation

  • Chen, Wang & Yang, Xinmin & Zhao, Yong, 2023. "Memory gradient method for multiobjective optimization," Applied Mathematics and Computation, Elsevier, vol. 443(C).
    • Handle: RePEc:eee:apmaco:v:443:y:2023:i:c:s0096300322008591
    DOI: 10.1016/j.amc.2022.127791
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322008591
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127791?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. 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).
    2. Hasani, Ali & Hosseini, Seyed Mohammad Hassan, 2020. "A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: Trade-off between production costs and energy consumption," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    3. Constantin Zopounidis & Emilios C. C Galariotis & Michael Doumpos & Stavroula Sarri & Kostas Andriosopoulos, 2015. "Multiple criteria decision aiding for finance: An updated bibliographic survey," Post-Print hal-02879842, HAL.
    4. J. Cruz Neto & G. Silva & O. Ferreira & J. Lopes, 2013. "A subgradient method for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 54(3), pages 461-472, April.
    5. 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.
    6. Wenyu Sun & Ya-Xiang Yuan, 2006. "Optimization Theory and Methods," Springer Optimization and Its Applications, Springer, number 978-0-387-24976-6, September.
    7. 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.
    8. 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.
    9. Vahid Morovati & Hadi Basirzadeh & Latif Pourkarimi, 2018. "Quasi-Newton methods for multiobjective optimization problems," 4OR, Springer, vol. 16(3), pages 261-294, September.
    10. Constantin Zopounidis & Emilios Galariotis & Michael Doumpos & Stavroula Sarri & Kostas Andriosopoulos, 2015. "Multiple criteria decision aiding for finance: An updated bibliographic survey," Post-Print hal-01183389, HAL.
    11. 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)

    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. 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.
    2. 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.
    3. 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).
    4. 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.
    5. Xiaopeng Zhao & Jen-Chih Yao, 2022. "Linear convergence of a nonmonotone projected gradient method for multiobjective optimization," Journal of Global Optimization, Springer, vol. 82(3), pages 577-594, March.
    6. M. L. N. Gonçalves & L. F. Prudente, 2020. "On the extension of the Hager–Zhang conjugate gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 76(3), pages 889-916, July.
    7. L. F. Prudente & D. R. Souza, 2022. "A Quasi-Newton Method with Wolfe Line Searches for Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 1107-1140, September.
    8. Jang Ho Kim & Yongjae Lee & Woo Chang Kim & Frank J. Fabozzi, 2022. "Goal-based investing based on multi-stage robust portfolio optimization," Annals of Operations Research, Springer, vol. 313(2), pages 1141-1158, June.
    9. Tsionas, Mike G., 2019. "Multi-objective optimization using statistical models," European Journal of Operational Research, Elsevier, vol. 276(1), pages 364-378.
    10. 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.
    11. Righi, Marcelo Brutti & Borenstein, Denis, 2018. "A simulation comparison of risk measures for portfolio optimization," Finance Research Letters, Elsevier, vol. 24(C), pages 105-112.
    12. Xidonas, Panos & Doukas, Haris & Hassapis, Christis, 2021. "Grouped data, investment committees & multicriteria portfolio selection," Journal of Business Research, Elsevier, vol. 129(C), pages 205-222.
    13. Fernando A. F. Ferreira & Ieva Meidutė-Kavaliauskienė & Edmundas K. Zavadskas & Marjan S. Jalali & Sandra M. J. Catarino, 2019. "A Judgment-Based Risk Assessment Framework for Consumer Loans," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 18(01), pages 7-33, January.
    14. G. Cocchi & M. Lapucci, 2020. "An augmented Lagrangian algorithm for multi-objective optimization," Computational Optimization and Applications, Springer, vol. 77(1), pages 29-56, September.
    15. Wątróbski, Jarosław & Jankowski, Jarosław & Ziemba, Paweł & Karczmarczyk, Artur & Zioło, Magdalena, 2019. "Generalised framework for multi-criteria method selection," Omega, Elsevier, vol. 86(C), pages 107-124.
    16. Yue Qi & Ralph E. Steuer, 2020. "On the analytical derivation of efficient sets in quad-and-higher criterion portfolio selection," Annals of Operations Research, Springer, vol. 293(2), pages 521-538, October.
    17. Fernando A. F. Ferreira & Sérgio P. Santos, 2021. "Two decades on the MACBETH approach: a bibliometric analysis," Annals of Operations Research, Springer, vol. 296(1), pages 901-925, January.
    18. Nomeda Dobrovolskienė & Rima Tamošiūnienė, 2016. "Sustainability-Oriented Financial Resource Allocation in a Project Portfolio through Multi-Criteria Decision-Making," Sustainability, MDPI, vol. 8(5), pages 1-18, May.
    19. 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.
    20. Alfredo N. Iusem & Jefferson G. Melo & Ray G. Serra, 2021. "A Strongly Convergent Proximal Point Method for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 183-200, 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:eee:apmaco:v:443:y:2023:i:c:s0096300322008591. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.