A variable metric forward-backward method with extrapolation
From MaRDI portal
Abstract: Forward-backward methods are a very useful tool for the minimization of a functional given by the sum of a differentiable term and a nondifferentiable one and their investigation has experienced several efforts from many researchers in the last decade. In this paper we focus on the convex case and, inspired by recent approaches for accelerating first-order iterative schemes, we develop a scaled inertial forward-backward algorithm which is based on a metric changing at each iteration and on a suitable extrapolation step. Unlike standard forward-backward methods with extrapolation, our scheme is able to handle functions whose domain is not the entire space. Both {an convergence rate estimate on the objective function values and the convergence of the sequence of the iterates} are proved. Numerical experiments on several {test problems arising from image processing, compressed sensing and statistical inference} show the {effectiveness} of the proposed method in comparison to well performing {state-of-the-art} algorithms.
Recommendations
- Inertial variable metric techniques for the inexact forward-backward algorithm
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- New convergence results for the inexact variable metric forward-backward method
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- A dynamical approach to an inertial forward-backward algorithm for convex minimization
Cites work
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 47179 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.
- A new steplength selection for scaled gradient methods with application to image deblurring
- A scaled gradient projection method for constrained image deblurring
- Accelerated and inexact forward-backward algorithms
- An affine-scaling interior-point CBB method for box-constrained optimization
- An inertial forward-backward algorithm for monotone inclusions
- Analysis of bounded variation penalty methods for ill-posed problems
- Bregman operator splitting with variable stepsize for total variation image reconstruction
- Compressed Sensing Performance Bounds Under Poisson Noise
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex optimization theory.
- Efficient gradient projection methods for edge-preserving removal of Poisson noise
- Image deblurring with Poisson data: from cells to galaxies
- Implementation of an optimal first-order method for strongly convex total variation regularization
- Inexact spectral projected gradient methods on convex sets
- Introductory lectures on convex optimization. A basic course.
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- New convergence results for the scaled gradient projection method
- Nonnegative least-squares image deblurring: improved gradient projection approaches
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms
- Proximal splitting methods in signal processing
- Signal Recovery by Proximal Forward-Backward Splitting
- This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
- Two-Point Step Size Gradient Methods
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Variable metric forward-backward splitting with applications to monotone inclusions in duality
- Variable metric inexact line-search-based methods for nonsmooth optimization
- Variable metric quasi-Fejér monotonicity
- iPiano: inertial proximal algorithm for nonconvex optimization
Cited in
(17)- Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems
- Scaled, inexact, and adaptive generalized FISTA for strongly convex optimization
- A nested primal-dual iterated Tikhonov method for regularized convex optimization
- A variable metric extrapolation proximal iterative hard thresholding method
- A preconditioned version of a nested primal-dual algorithm for image deblurring
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- The degenerate variable metric proximal point algorithm and adaptive stepsizes for primal–dual Douglas–Rachford
- Inertial variable metric techniques for the inexact forward-backward algorithm
- A variable metric proximal stochastic gradient method: an application to classification problems
- Backtracking strategies for accelerated descent methods with smooth composite objectives
- Variable metric techniques for forward-backward methods in imaging
- A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program
- Algorithmic unfolding for image reconstruction and localization problems in single-molecule fluorescence microscopy
- Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm
- Convergence analysis of a variable metric forward-backward splitting algorithm with applications
- Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
- Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients
This page was built for publication: A variable metric forward-backward method with extrapolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2818247)
