Please use this identifier to cite or link to this item:
Title: On convergence rates of linea rized proximal algorithms for convex composite optimization with applications
Authors: Hu, Y
Li, C
Yang, X 
Keywords: Convex composite optimization
Feasibility problem
Linearized proximal algorithm
Quasi-regularity condition
Sensor network localization
Weak sharp minima
Issue Date: 2016
Publisher: Society for Industrial and Applied Mathematics
Source: SIAM journal on optimization, 2016, v. 26, no. 2, p. 1207-1235 How to cite?
Journal: SIAM journal on optimization 
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.
ISSN: 1052-6234
EISSN: 1095-7189
DOI: 10.1137/140993090
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jan 19, 2019


Last Week
Last month
Citations as of Jan 17, 2019

Page view(s)

Last Week
Last month
Citations as of Jan 14, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.