Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/61864
Title: | On convergence rates of linea rized proximal algorithms for convex composite optimization with applications | Authors: | Hu, Y Li, C Yang, X |
Issue Date: | 2016 | Source: | SIAM journal on optimization, 2016, v. 26, no. 2, p. 1207-1235 | Abstract: | In the present paper, we investigate a linearized p roximal algorithm (LPA) for solving a convex composite optimization problem. Each iteration of the LPA is a proximal minimization of the convex composite function with the inner function being linearized at the current iterate. The LPA has the attractive computational advantage that the solution of each subproblem is a singleton, which avoids the difficulty as in the Gauss-Newton method (GNM) of finding a solution with minimum norm among the set of minima of its subproblem, while still maintaining the same local convergence rate as that of the GNM. Under the assumptions of local weak sharp minima of order p (p ∈ [1,2]) and a quasi-regularity condition, we establish a local superlinear convergence rate for the LPA. We also propose a globalization strategy for the LPA based on a backtracking line-search and an inexact version of the LPA. We further apply the LPA to solve a (possibly nonconvex) feasibility problem, as well as a sensor network localization problem. Our numerical results illustrate that the LPA meets the demand for an efficient and robust algorithm for the sensor network localization problem. | Keywords: | Convex composite optimization Feasibility problem Linearized proximal algorithm Quasi-regularity condition Sensor network localization Weak sharp minima |
Publisher: | Society for Industrial and Applied Mathematics | Journal: | SIAM journal on optimization | ISSN: | 1052-6234 | EISSN: | 1095-7189 | DOI: | 10.1137/140993090 | Rights: | © 2016 Society for Industrial and Applied Mathematics The following publication Hu, Y., Li, C., & Yang, X. (2016). On convergence rates of linearized proximal algorithms for convex composite optimization with applications. SIAM Journal on Optimization, 26(2), 1207-1235 is available at https://doi.org/10.1137/140993090 |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
140993090.pdf | 358.85 kB | Adobe PDF | View/Open |
Page views
125
Last Week
0
0
Last month
Citations as of Apr 28, 2024
Downloads
53
Citations as of Apr 28, 2024
SCOPUSTM
Citations
49
Last Week
0
0
Last month
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
41
Last Week
0
0
Last month
Citations as of May 2, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.