An accelerated proximal gradient method for multiobjective optimization

This paper presents an accelerated proximal gradient method for multiobjective optimization, in which each objective function is the sum of a continuously differentiable, convex function and a closed, proper, convex function. Extending first-order methods for multiobjective problems without scalariz...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational optimization and applications Ročník 86; číslo 2; s. 421 - 455
Hlavní autoři: Tanabe, Hiroki, Fukuda, Ellen H., Yamashita, Nobuo
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.11.2023
Springer Nature B.V
Témata:
Algorithms
Convergence
Convex and Discrete Geometry
Iterative methods
Management Science
Mathematics
Mathematics and Statistics
Methods
Multiple objective analysis
Operations Research
Operations Research/Decision Theory
Optimization
Statistics
FISTA
Global rate of convergence
90C25
Multiobjective optimization
Pareto optimality
90C29
First-order method
Proximal gradient method
ISSN:0926-6003, 1573-2894
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents an accelerated proximal gradient method for multiobjective optimization, in which each objective function is the sum of a continuously differentiable, convex function and a closed, proper, convex function. Extending first-order methods for multiobjective problems without scalarization has been widely studied, but providing accelerated methods with accurate proofs of convergence rates remains an open problem. Our proposed method is a multiobjective generalization of the accelerated proximal gradient method, also known as the Fast Iterative Shrinkage-Thresholding Algorithm, for scalar optimization. The key to this successful extension is solving a subproblem with terms exclusive to the multiobjective case. This approach allows us to demonstrate the global convergence rate of the proposed method ( O ( 1 / k 2 ) ), using a merit function to measure the complexity. Furthermore, we present an efficient way to solve the subproblem via its dual representation, and we confirm the validity of the proposed method through some numerical experiments.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0926-6003
1573-2894
DOI:10.1007/s10589-023-00497-w