Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients

Xiaopeng Zhao (), Ravi Raushan (), Debdas Ghosh (), Jen-Chih Yao () and Min Qi ()
Additional contact information
Xiaopeng Zhao: Tiangong University
Ravi Raushan: Indian Institute of Technology (BHU)
Debdas Ghosh: Indian Institute of Technology (BHU)
Jen-Chih Yao: China Medical University Hospital, China Medical University
Min Qi: Tiangong University

Computational Optimization and Applications, 2025, vol. 91, issue 1, No 2, 27-66

Abstract: Abstract This paper analyzes a proximal gradient method for nondifferentiable convex multiobjective optimization problems, where the components of the objective function are the sum of a proper lower semicontinuous function and a continuously differentiable function. By adopting a typical line search procedure, it is found that without a Lipschitz continuity of the gradients of the smooth part of the objective function, the proposed method is able to generate sequences that converge to weakly Pareto optimal points. The convergence rate of the method is found to be $$\mathcal {O}(1/k)$$ O ( 1 / k ) . Further, if the smooth component in the objective function is strongly convex, then the convergence rate is $$\mathcal {O}(r^k)$$ O ( r k ) for some $$r\in (0,1)$$ r ∈ ( 0 , 1 ) . Moreover, in the absence of a strong convexity assumption, we also consider the accelerated version of the proposed approach based on the Nesterov step strategy. We obtain the improved convergence rate of $$\mathcal {O}(1/k^2)$$ O ( 1 / k 2 ) , which is measured by a merit function. Numerical implementation strategies and performance profiles of the proposed methods on the considered problem involving $$\ell _1$$ ℓ 1 -norm and indicator function are also provided.

Keywords: Multiobjective optimization; Proximal gradient method; Pareto optimality; Iteration complexity; 49M37; 65K05; 90C29; 90C30 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-025-00663-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:91:y:2025:i:1:d:10.1007_s10589-025-00663-2

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-025-00663-2

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().