On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
From MaRDI portal
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.
Recommendations
- Variable metric inexact line-search-based methods for nonsmooth optimization
- A note on the accelerated proximal gradient method for nonconvex optimization
- A block coordinate variable metric linesearch based proximal gradient method
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- scientific article; zbMATH DE number 7404502
Cited in
(55)- A proximal iterative approach to a non-convex optimization problem
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Global convergence of proximal iteratively reweighted algorithm
- Extragradient method in optimization: convergence and complexity
- Introduction to the special issue for SIMAI 2016
- A block coordinate variable metric linesearch based proximal gradient method
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
- Variable metric techniques for forward-backward methods in imaging
- On starting and stopping criteria for nested primal-dual iterations
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Inexact successive quadratic approximation for regularized optimization
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- New convergence results for the inexact variable metric forward-backward method
- An abstract convergence framework with application to inertial inexact forward-backward methods
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
- Inexact half-quadratic optimization for linear inverse problems
- 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
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- Convergence guarantees for a class of non-convex and non-smooth optimization problems
- A note on the accelerated proximal gradient method for nonconvex optimization
- Modern regularization methods for inverse problems
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- Adaptive FISTA for Nonconvex Optimization
- scientific article; zbMATH DE number 6453672 (Why is no real title available?)
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
- Choose your path wisely: gradient descent in a Bregman distance framework
- On the convergence rate of projected gradient descent for a back-projection based objective
- Sparse inpainting with smoothed particle hydrodynamics
- On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- 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
- A new proximal heavy ball inexact line-search algorithm
- Convergence analysis of block majorize-minimize subspace approach
- A structured L-BFGS method and its application to inverse problems
- A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
- Inexact reduced gradient methods in nonconvex optimization
- Pathwise optimization for bridge-type estimators and its applications
- A new random reshuffling method for nonsmooth nonconvex finite-sum optimization
- An inexact proximal majorization-minimization method for a class of image reconstruction models
- An inexact q-order regularized proximal Newton method for nonconvex composite optimization
- A variable metric extrapolation proximal iterative hard thresholding method
- Efficient parallel data optimization for homogeneous diffusion inpainting of 4K images
- Connecting image inpainting with denoising in the homogeneous diffusion setting
- A block coordinate variable metric forward-backward algorithm
This page was built for publication: On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268471)
