Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria

The Bregman proximal gradient method (BPGM), which uses the Bregman distance as a proximity measure in the iterative scheme, has recently been redeveloped for minimizing convex composite problems without the global Lipschitz gradient continuity assumption. This makes the BPGM appealing for a wide range of applications, and hence, it has received growing attention in recent years. However, most existing convergence results are obtained only under the assumption that the involved subproblems are solved exactly, which is unrealistic in many applications and limits the applicability of the BPGM. To make the BPGM implementable and practical, in this paper, we develop inexact versions of the BPGM (denoted by iBPGM) by employing either an absolute-type stopping criterion or a partial relative-type stopping criterion for solving the subproblems. The [Formula: see text] convergence rate and the convergence of the sequence are also established for our iBPGM under some conditions. Moreover, we develop an inertial variant of our iBPGM (denoted by v-iBPGM) and establish the [Formula: see text] convergence rate, where [Formula: see text] is a restricted relative smoothness exponent, depending on the smooth function in the objective and the kernel function. Specially, when the smooth function in the objective has a Lipschitz continuous gradient and the kernel function is strongly convex, we have γ = 2, and thus the v-iBPGM improves the convergence rate of the iBPGM from [Formula: see text] to [Formula: see text], in accordance with the existing results on the exact accelerated BPGM. Finally, some preliminary numerical experiments for solving the discrete quadratic regularized optimal transport problem are conducted to illustrate the convergence behaviors of our iBPGM and v-iBPGM under different inexactness settings. Funding: The research of first author is supported in part by the National Natural Science Foundation of China under Grant 12301411, the Natural Science Foundation of Guangdong under Grant 2023A1515012026, and the Basic and Applied Basic Research Foundation of Guangzhou under Grant 2024A04J4184. The research of second author is supported in part by the Ministry of Education, Singapore, under Academic Research Fund Tier 1 Grant A00084930000.

Authors

Institutions

Publication Details

Journal
Mathematics of Operations Research
Published
2025-03-28
DOI
https://doi.org/10.1287/moor.2023.0328
Citations
2
Primary Topic
Sparse and Compressive Sensing Techniques
Type
article
Field-Weighted Citation Impact
2.67
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria

Lei Yang, Kim-Chuan Toh
2 citations
Mathematics of Operations Research
Sparse and Compressive Sensing Techniques
2.67
article

Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria

Lei Yang, Kim-Chuan Toh
article en
2 citations

Abstract

The Bregman proximal gradient method (BPGM), which uses the Bregman distance as a proximity measure in the iterative scheme, has recently been redeveloped for minimizing convex composite problems without the global Lipschitz gradient continuity assumption. This makes the BPGM appealing for a wide range of applications, and hence, it has received growing attention in recent years. However, most existing convergence results are obtained only under the assumption that the involved subproblems are solved exactly, which is unrealistic in many applications and limits the applicability of the BPGM. To make the BPGM implementable and practical, in this paper, we develop inexact versions of the BPGM (denoted by iBPGM) by employing either an absolute-type stopping criterion or a partial relative-type stopping criterion for solving the subproblems. The [Formula: see text] convergence rate and the convergence of the sequence are also established for our iBPGM under some conditions. Moreover, we develop an inertial variant of our iBPGM (denoted by v-iBPGM) and establish the [Formula: see text] convergence rate, where [Formula: see text] is a restricted relative smoothness exponent, depending on the smooth function in the objective and the kernel function. Specially, when the smooth function in the objective has a Lipschitz continuous gradient and the kernel function is strongly convex, we have γ = 2, and thus the v-iBPGM improves the convergence rate of the iBPGM from [Formula: see text] to [Formula: see text], in accordance with the existing results on the exact accelerated BPGM. Finally, some preliminary numerical experiments for solving the discrete quadratic regularized optimal transport problem are conducted to illustrate the convergence behaviors of our iBPGM and v-iBPGM under different inexactness settings. Funding: The research of first author is supported in part by the National Natural Science Foundation of China under Grant 12301411, the Natural Science Foundation of Guangdong under Grant 2023A1515012026, and the Basic and Applied Basic Research Foundation of Guangzhou under Grant 2024A04J4184. The research of second author is supported in part by the Ministry of Education, Singapore, under Academic Research Fund Tier 1 Grant A00084930000.

Mathematics of Operations ResearchVol. 51(1)
Sun Yat-sen University (CN), National University of Singapore (SG)
Openalex Percentile: Top 13%
Sparse and Compressive Sensing Techniques
2.67
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.