Metraipolis › archive › dc_17aaed8fdafd
The Convergence Rate of Accelerated Proximal Gradient Methods with General Inertia Term for Convex Composite Multiobjective Optimization — arXiv:2611.06125
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06125
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:27:25.963Z
- SHA-256 of the archived text
2379d9ad50c86347b19aafdb420431c07279bcb92033a3e2377b9fe4489de69d- Stable URL of this page
https://metraipolis.com/documento/dc_17aaed8fdafd
How to cite
The Convergence Rate of Accelerated Proximal Gradient Methods with General Inertia Term for Convex Composite Multiobjective Optimization — arXiv:2611.06125 — arXiv (en), https://arxiv.org/abs/2611.06125 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_17aaed8fdafd (Metraipolis archive dc_17aaed8fdafd, sha256 2379d9ad50c86347b19aafdb420431c07279bcb92033a3e2377b9fe4489de69d)
BibTeX
@misc{dc17aaed8fdafd,
title = {The Convergence Rate of Accelerated Proximal Gradient Methods with General Inertia Term for Convex Composite Multiobjective Optimization — arXiv:2611.06125},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06125},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_17aaed8fdafd; sha256 2379d9ad50c86347b19aafdb420431c07279bcb92033a3e2377b9fe4489de69d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06125. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study accelerated proximal gradient methods with general stepsizes for convex composite multiobjective optimization, in which every objective is the sum of a smooth convex term and a proper closed convex extended-valued term, and the proximal subproblem retains a separate offset for each objective. The momentum coefficient may depend on the computed trajectory. For a two-parameter root momentum rule we prove boundedness, weighted square summability of the displacements, a merit-function rate of $o(k^{-2})$, and displacement decay of $o(k^{-1})$ whenever the first parameter converges to a value in $(0,1)$; the second parameter need not converge or have bounded total variation. The analysis is organized as a chain of basic estimates, an energy identity, coefficient asymptotics, and auxiliary lemmas that are reused in every regime. For the critical parameter $\alpha=3$ we establish the finite bound $u_0(x^N)\le 2\ell R/[N(N+3)]$, square summability of the displacements, displacement decay $O(1/N)$, and convergence of the full sequence to a weak Pareto point. The remaining little-o question at $\alpha=3$ is shown to be exactly the vanishing of a nonnegative critical energy, so it is separated from the large-$O$ estimate rather than left as a missing step. For $1<\alpha<3$ we give the rate $O(N^{-(\alpha-1)})$ and for every $\alpha>0$ the qualitative conclusion $u_0(x^k)\to0$, $F_i(x^k)\to c_i$, and $\sum_k D_k/k<\infty$. A table summarizes the rate picture over the whole positive range of $\alpha$, and a JOS1 experiment illustrates the predicted little-$o$ separation.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.06125 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:17:34.243Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).