| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Technion Israel Inst Technol, Dept Math, IL-3200003 Haifa - Israel
[2] CNPq, Campinas, SP - Brazil
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS; v. 182, n. 3, p. 851-884, SEP 2019. |
| Web of Science Citations: | 0 |
| Abstract | |
The problem of minimization of the sum of two convex functions has various theoretical and real-world applications. One of the popular methods for solving this problem is the proximal gradient method (proximal forward-backward algorithm). A very common assumption in the use of this method is that the gradient of the smooth term is globally Lipschitz continuous. However, this assumption is not always satisfied in practice, thus casting a limitation on the method. In this paper, we discuss, in a wide class of finite- and infinite-dimensional spaces, a new variant of the proximal gradient method, which does not impose the above-mentioned global Lipschitz continuity assumption. A key contribution of the method is the dependence of the iterative steps on a certain telescopic decomposition of the constraint set into subsets. Moreover, we use a Bregman divergence in the proximal forward-backward operation. Under certain practical conditions, a non-asymptotic rate of convergence (that is, in the function values) is established, as well as the weak convergence of the whole sequence to a minimizer. We also obtain a few auxiliary results of independent interest. (AU) | |
| FAPESP's process: | 13/19504-9 - Methods in optimization and feasibility for inverse problems and tomography |
| Grantee: | Daniel Reem |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |