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

DOI10.1088/1361-6420/aa5bfdzbMath1373.65040arXiv1605.03791OpenAlexW2392724003MaRDI QIDQ5268471

Marco Prato, Simone Rebegoldi, Silvia Bonettini, Federica Porta, Ignace Loris

Publication date: 20 June 2017

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.03791

zbMATH Keywords

algorithm convergence inverse problem numerical result variable metric proximal gradient methods linesearch methods image processing applications

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items (27)

Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ New convergence results for the inexact variable metric forward-backward method ⋮ On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization ⋮ Inexact successive quadratic approximation for regularized optimization ⋮ A comparison of edge-preserving approaches for differential interference contrast microscopy ⋮ Combined Newton-gradient method for constrained root-finding in chemical reaction networks ⋮ Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification ⋮ Template-based image reconstruction facing different topologies ⋮ Analysis of a variable metric block coordinate method under proximal errors ⋮ An abstract convergence framework with application to inertial inexact forward-backward methods ⋮ Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ Variable metric techniques for forward-backward methods in imaging ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ On starting and stopping criteria for nested primal-dual iterations ⋮ Globalized inexact proximal Newton-type methods for nonconvex composite functions ⋮ Introduction to the special issue for SIMAI 2016 ⋮ A block coordinate variable metric linesearch based proximal gradient method ⋮ Modern regularization methods for inverse problems ⋮ On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence ⋮ Adaptive FISTA for Nonconvex Optimization ⋮ Variable Metric Forward-Backward Algorithm for Composite Minimization Problems ⋮ On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms ⋮ On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint ⋮ Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework ⋮ Sparse Inpainting with Smoothed Particle Hydrodynamics ⋮ Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems

Uses Software

This page was built for publication: On the convergence of a linesearch based proximal-gradient method for nonconvex optimization