Variable metric inexact line-search-based methods for nonsmooth optimization
From MaRDI portal
Publication:2802142
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.
Recommendations
- A variable metric method for nonsmooth convex constrained optimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Inexact variable metric method for convex-constrained optimization problems
- scientific article; zbMATH DE number 617930
- scientific article; zbMATH DE number 3682547
- Nonsmoothness and a variable metric method
- New variable-metric algorithms for nondifferentiable optimization problems
- Variable metrid method for minimization of partially separable nonsmooth functions
- A self-correcting variable-metric algorithm framework for nonsmooth optimization
- A Class of Inexact Variable Metric Proximal Point Algorithms
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A convergent blind deconvolution method for post-adaptive-optics astronomical imaging
- A coordinate gradient descent method for nonsmooth separable minimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A scaled gradient projection method for Bayesian learning in dynamical systems
- A scaled gradient projection method for constrained image deblurring
- Accelerated and inexact forward-backward algorithms
- Adaptive subgradient methods for online learning and stochastic optimization
- An affine-scaling interior-point CBB method for box-constrained optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Analysis
- Deblurring Images
- Inexact and accelerated proximal point algorithms
- Inexact spectral projected gradient methods on convex sets
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Linear convergence of iterative soft-thresholding
- New convergence results for the scaled gradient projection method
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Nonlinear total variation based noise removal algorithms
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- On some steplength approaches for proximal algorithms
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- Proximal splitting methods in signal processing
- Scaling techniques for gradient projection-type methods in astronomical image deblurring
- Signal Recovery by Proximal Forward-Backward Splitting
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- 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 quasi-Fejér monotonicity
Cited in
(54)- Inexact variable metric stochastic block-coordinate descent for regularized optimization
- An acceleration of proximal diagonal Newton method
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- scientific article; zbMATH DE number 1293853 (Why is no real title available?)
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- Parameter-free accelerated gradient descent for nonconvex minimization
- Scaled, inexact, and adaptive generalized FISTA for strongly convex optimization
- A nested primal-dual FISTA-like scheme for composite convex optimization problems
- Inexact successive quadratic approximation for regularized optimization
- On starting and stopping criteria for nested primal-dual iterations
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- Shearlet-based regularization in statistical inverse learning with an application to x-ray tomography
- Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization
- Inertial variable metric techniques for the inexact forward-backward algorithm
- A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
- Inexact first-order primal-dual algorithms
- Adaptive FISTA for Nonconvex Optimization
- Composite optimization by nonconvex majorization-minimization
- Variable metric techniques for forward-backward methods in imaging
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization
- A line search based proximal stochastic gradient algorithm with dynamical variance reduction
- Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- A phase model using the Huber norm for estimating point spread function under frozen flow hypothesis
- Fixed points of non-smooth functions on finite dimensional ordered Banach spaces via Clarke generalized Jacobian
- Inexact variable metric method for convex-constrained optimization problems
- A proximal interior point algorithm with applications to image processing
- Extragradient method with feasible inexact projection to variational inequality problem
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- SISAL revisited
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- A block coordinate variable metric linesearch based proximal gradient method
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method
- Analysis of a variable metric block coordinate method under proximal errors
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- A variable metric method for nonsmooth convex constrained optimization
- A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
- Nonsmoothness and a variable metric method
- On the inexact scaled gradient projection method
- An abstract convergence framework with application to inertial inexact forward-backward methods
- Choose your path wisely: gradient descent in a Bregman distance framework
- A proximal stochastic quasi-Newton algorithm with dynamical sampling and stochastic line search
- Modern regularization methods for inverse problems
- A variable metric forward-backward method with extrapolation
- Scaling techniques for \(\epsilon\)-subgradient methods
- Proximal extrapolated gradient methods for variational inequalities
- New convergence results for the inexact variable metric forward-backward method
- A view of computational models for image segmentation
- A new proximal heavy ball inexact line-search algorithm
- A nonsmooth regularization approach based on shearlets for Poisson noise removal in ROI tomography
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
- ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration
This page was built for publication: Variable metric inexact line-search-based methods for nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802142)
