On the convergence of a linesearch based proximal-gradient method for nonconvex optimization

Abstract

We consider a variable metric linesearch based proximal gradient method for the minimization of the sum of a smooth, possibly nonconvex function plus a convex, possibly nonsmooth term. We prove convergence of this iterative algorithm to a critical point if the objective function satisfies the Kurdyka-Lojasiewicz property at each point of its domain, under the assumption that a limit point exists. The proposed method is applied to a wide collection of image processing problems and our numerical tests show that our algorithm results to be flexible, robust and competitive when compared to recently proposed approaches able to address the optimization problems arising in the considered applications.

References in corpus (8)

• Splitting methods with variable metric for KL functions
• A primal-dual hybrid gradient method for non-linear operators with applications to MRI
• Variable metric inexact line-search based methods for nonsmooth optimization
• Accelerating gradient projection methods for ${\ell }_1$-constrained signal recovery by steplength selection rules
• Efficient deconvolution methods for astronomical imaging: algorithms and IDL-GPU codes
• New convergence results for the scaled gradient projection method
• A new steplength selection for scaled gradient methods with application to image deblurring
• A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation

Cited by in corpus (13)

• Beyond Alternating Updates for Matrix Factorization with Inertial Bregman Proximal Gradient Algorithms
• Accelerating Inexact Successive Quadratic Approximation for Regularized Optimization Through Manifold Identification
• An abstract convergence framework with application to inertial inexact forward--backward methods
• Efficient Neural Generation of 4K Masks for Homogeneous Diffusion Inpainting
• On The Geometric Analysis of A Quartic-quadratic Optimization Problem under A Spherical Constraint
• Analysis and Performance of the Barzilai-Borwein Step-Size Rules for Optimization Problems in Hilbert Spaces
• On starting and stopping criteria for nested primal-dual iterations
• A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
• Connecting Image Inpainting with Denoising in the Homogeneous Diffusion Setting
• New Pair of Primal Dual Algorithms for Bregman Iterated Variational Regularization
• Proximal Dogleg Opportunistic Majorization for Nonconvex and Nonsmooth Optimization
• On a fixed-point continuation method for a convex optimization problem
• Optimising Different Feature Types for Inpainting-based Image Representations