Variable metric inexact line-search-based methods for nonsmooth optimization
From MaRDI portal
Publication:2802142
DOI10.1137/15M1019325zbMATH Open1338.65157arXiv1506.00385MaRDI QIDQ2802142FDOQ2802142
M. Prato, F. Porta, S. Bonettini, Ignace Loris
Publication date: 25 April 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1506.00385
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
- 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
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- Nonlinear total variation based noise removal algorithms
- Convex Analysis
- A coordinate gradient descent method for nonsmooth separable minimization
- Title not available (Why is that?)
- Proximal Splitting Methods in Signal Processing
- Signal Recovery by Proximal Forward-Backward Splitting
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Accelerated and inexact forward-backward algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A scaled gradient projection method for constrained image deblurring
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Deblurring Images
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Variable metric quasi-Fejér monotonicity
- An affine-scaling interior-point CBB method for box-constrained optimization
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- On some steplength approaches for proximal algorithms
- Title not available (Why is that?)
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Inexact spectral projected gradient methods on convex sets
- Linear convergence of iterative soft-thresholding
- 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
- Scaling techniques for gradient projection-type methods in astronomical image deblurring
- A Scaled Gradient Projection Method for Bayesian Learning in Dynamical Systems
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- A convergent blind deconvolution method for post-adaptive-optics astronomical imaging
- New convergence results for the scaled gradient projection method
Cited In (51)
- A proximal stochastic quasi-Newton algorithm with dynamical sampling and stochastic line search
- Inexact variable metric stochastic block-coordinate descent for regularized optimization
- Title not available (Why is that?)
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- Parameter-free accelerated gradient descent for nonconvex minimization
- Title not available (Why is that?)
- 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
- Shearlet-based regularization in statistical inverse learning with an application to x-ray tomography
- On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
- SISAL Revisited
- Adaptive FISTA for Nonconvex Optimization
- Inexact first-order primal-dual algorithms
- On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization
- Variable metric techniques for forward-backward methods in imaging
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- 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
- Inexact variable metric method for convex-constrained optimization problems
- Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework
- Extragradient method with feasible inexact projection to variational inequality problem
- A proximal interior point algorithm with applications to image processing
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Analysis of a variable metric block coordinate method under proximal errors
- A block coordinate variable metric linesearch based proximal gradient method
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method
- A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
- Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope
- A variable metric method for nonsmooth convex constrained optimization
- 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
- Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm
- Modern regularization methods for inverse problems
- Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization
- 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 new proximal heavy ball inexact line-search algorithm
- A view of computational models for image segmentation
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
- A nonsmooth regularization approach based on shearlets for Poisson noise removal in ROI tomography
- ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration
- An acceleration of proximal diagonal Newton method
- Composite Optimization by Nonconvex Majorization-Minimization
Uses Software
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)
