Variable metric inexact line-search based methods for nonsmooth optimization

Abstract

We develop a new proximal-gradient method for minimizing the sum of a differentiable, possibly nonconvex, function plus a convex, possibly non differentiable, function. The key features of the proposed method are the definition of a suitable descent direction, based on the proximal operator associated to the convex part of the objective function, and an Armijo-like rule to determine the step size along this direction ensuring the sufficient decrease of the objective function. In this frame, we especially address the possibility of adopting a metric which may change at each iteration and an inexact computation of the proximal point defining the descent direction. For the more general nonconvex case, we prove that all limit points of the iterates sequence are stationary, while for convex objective functions we prove the convergence of the whole sequence to a minimizer, under the assumption that a minimizer exists. In the latter case, assuming also that the gradient of the smooth part of the objective function is Lipschitz, we also give a convergence rate estimate, showing the O(1/k) complexity with respect to the function values. We also discuss verifiable sufficient conditions for the inexact proximal point and we present the results of a numerical experience on a convex total variation based image restoration problem, showing that the proposed approach is competitive with another state-of-the-art method.

Cited by in corpus (17)

• On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
• Proximal extrapolated gradient methods for variational inequalities
• A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
• Preconditioned ADMM with nonlinear operator constraint
• Projected Nesterov's Proximal-Gradient Algorithm for Sparse Signal Reconstruction with a Convex Constraint
• Beyond Alternating Updates for Matrix Factorization with Inertial Bregman Proximal Gradient Algorithms
• A Complex Quasi-Newton Proximal Method for Image Reconstruction in Compressed Sensing MRI
• Generalized Fejér monotone sequences and their finitary content
• An abstract convergence framework with application to inertial inexact forward--backward methods
• Parameter-free accelerated gradient descent for nonconvex minimization
• Shearlet-based regularization in statistical inverse learning with an application to X-ray tomography
• On starting and stopping criteria for nested primal-dual iterations
• A Variational Approach on Level sets and Linear Convergence of Variable Bregman Proximal Gradient Method for Nonconvex Optimization Problems
• A General Convergence Result for Mirror Descent with Armijo Line Search
• Regularization with optimal space-time priors
• A Distributed Quasi-Newton Algorithm for Primal and Dual Regularized Empirical Risk Minimization
• Level-set Subdifferential Error Bounds and Linear Convergence of Variable Bregman Proximal Gradient Method