IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v33y2025i1d10.1007_s11750-024-00680-0.html
   My bibliography  Save this article

On the convergence analysis of a proximal gradient method for multiobjective optimization

Author

Listed:
  • Xiaopeng Zhao

    (Tiangong University)

  • Debdas Ghosh

    (Indian Institute of Technology (BHU))

  • Xiaolong Qin

    (Zhejiang Normal University)

  • Christiane Tammer

    (Martin-Luther-University Halle-Wittenberg)

  • Jen-Chih Yao

    (China Medical University
    Academy of Romanian Scientists)

Abstract

We propose a proximal gradient method for unconstrained nondifferentiable multiobjective optimization problems with the objective function being the sum of a proper lower semicontinuous convex function and a continuously differentiable function. We have shown under appropriate assumptions that each accumulation point of the sequence generated by the algorithm is Pareto stationary. Further, when imposing convexity on the smooth component of the objective function, the convergence of the generated iterative sequence to a weak Pareto optimal point of the problem is established. Meanwhile, the convergence rate of the proposed method is analyzed when the smooth component function in the objective function is non-convex ( $$\mathcal {O}(\sqrt{1/k})$$ O ( 1 / k ) ), convex ( $$\mathcal {O}(1/k)$$ O ( 1 / k ) ), and strongly convex ( $$\mathcal {O}(r^k)$$ O ( r k ) for some $$r\in (0,1)$$ r ∈ ( 0 , 1 ) ), respectively, here k is the number of iterations. The performance of the proposed method on a few test problems with an $$\ell _1$$ ℓ 1 -norm function and with the indicator function is provided.

Suggested Citation

  • Xiaopeng Zhao & Debdas Ghosh & Xiaolong Qin & Christiane Tammer & Jen-Chih Yao, 2025. "On the convergence analysis of a proximal gradient method for multiobjective optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 33(1), pages 102-132, April.
  • Handle: RePEc:spr:topjnl:v:33:y:2025:i:1:d:10.1007_s11750-024-00680-0
    DOI: 10.1007/s11750-024-00680-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-024-00680-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/s11750-024-00680-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.

    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:topjnl:v:33:y:2025:i:1:d:10.1007_s11750-024-00680-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.

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