A block coordinate variable metric linesearch based proximal gradient method

• Published in: Computational optimization and applications Vol. 71; no. 1; pp. 5 - 52
• Main Authors: Bonettini, S., Prato, M., Rebegoldi, S.
• Format: Journal Article
• Language: English
• Published: New York Springer US 01-09-2018; Springer Nature B.V
• Subjects: Convex and Discrete Geometry; Management Science; Mathematics; Mathematics and Statistics; Operations Research; Operations Research/Decision Theory; Operators (mathematics); Optimization; Statistics; Variables; Alternating optimization; Proximal gradient methods; Kurdyka-Łojasiewicz inequality
• ISSN: 0926-6003; 1573-2894
• DOI: 10.1007/s10589-018-0011-5

In this paper we propose an alternating block version of a variable metric linesearch proximal gradient method. This algorithm addresses problems where the objective function is the sum of a smooth term, whose variables may be coupled, plus a separable part given by the sum of two or more convex, possibly nonsmooth functions, each depending on a single block of variables. Our approach is characterized by the possibility of performing several proximal gradient steps for updating every block of variables and by the Armijo backtracking linesearch for adaptively computing the steplength parameter. Under the assumption that the objective function satisfies the Kurdyka-Łojasiewicz property at each point of its domain and the gradient of the smooth part is locally Lipschitz continuous, we prove the convergence of the iterates sequence generated by the method. Numerical experience on an image blind deconvolution problem show the improvements obtained by adopting a variable number of inner block iterations combined with a variable metric in the computation of the proximal operator.