On the Convergence of Newton-type Proximal Gradient Method for Multiobjective Optimization Problems
Abstract
In a recent study, Ansary (Optim Methods Softw 38(3):570-590,2023) proposed a Newton-type proximal gradient method for nonlinear multiobjective optimization problems (NPGMO). However, the favorable convergence properties typically associated with Newton-type methods were not established for NPGMO in Ansary's work. In response to this gap, we develop a straightforward framework for analyzing the convergence behavior of the NPGMO. Specifically, under the assumption of strong convexity, we demonstrate that the NPGMO enjoys quadratic termination, superlinear convergence, and quadratic convergence for problems that are quadratic, twice continuously differentiable and twice Lipschitz continuously differentiable, respectively.
Cite
@article{arxiv.2308.10140,
title = {On the Convergence of Newton-type Proximal Gradient Method for Multiobjective Optimization Problems},
author = {Jian Chen and Xiaoxue Jiang and Liping Tang and Xinmin Yang},
journal= {arXiv preprint arXiv:2308.10140},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:2306.09797