The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
From MaRDI portal
Publication:5363380
DOI10.1137/16M1073741zbMath1375.65085arXiv1605.00952MaRDI QIDQ5363380
Publication date: 6 October 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.00952
convergence ratesglobal convergenceconvex optimizationnumerical examplesvariable metricforward-backward algorithminexact line search methodsquasi-Fejér sequences
Related Items (28)
An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems ⋮ Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis ⋮ Parallel Normal S-Iteration Methods with Applications to Optimization Problems ⋮ The developments of proximal point algorithms ⋮ Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC ⋮ New convergence results for the inexact variable metric forward-backward method ⋮ Quadratic growth conditions and uniqueness of optimal solution to Lasso ⋮ Convergence of the exponentiated gradient method with Armijo line search ⋮ A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems ⋮ Multi-step inertial forward-backward-half forward algorithm for solving monotone inclusion ⋮ Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry ⋮ Convergence Analysis for Bregman Iterations in Minimizing a Class of Landau Free Energy Functionals ⋮ Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions ⋮ An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration ⋮ A proximal interior point algorithm with applications to image processing ⋮ Unnamed Item ⋮ Variable metric techniques for forward-backward methods in imaging ⋮ Proximal extrapolated gradient methods for variational inequalities ⋮ Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions ⋮ On the linear convergence of forward-backward splitting method. I: Convergence analysis ⋮ A block coordinate variable metric linesearch based proximal gradient method ⋮ Modified Fejér sequences and applications ⋮ Bregman forward-backward operator splitting ⋮ Generalized support vector regression: Duality and tensor-kernel representation ⋮ The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces ⋮ On the finite termination of the gradient projection method ⋮ Four-operator splitting via a forward-backward-half-forward algorithm with line search ⋮ Proximal Gradient Methods for Machine Learning and Imaging
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Regularization methods in Banach spaces.
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Compositions and convex combinations of averaged nonexpansive operators
- On the convergence properties of the projected gradient method for convex optimization
- Variable metric quasi-Fejér monotonicity
- A coordinate gradient descent method for nonsmooth separable minimization
- Modified Fejér sequences and applications
- On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization
- On the convergence of the forward–backward splitting method with linesearches
- Proximal Newton-Type Methods for Minimizing Composite Functions
- The Baillon-Haddad Theorem Revisited
- Two-Metric Projection Methods for Constrained Optimization
- New convergence results for the scaled gradient projection method
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Projected gradient methods for linearly constrained problems
- On the Goldstein-Levitin-Polyak gradient projection method
- Convergence Rates in Forward--Backward Splitting
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- What is the Subdifferential of the Closed Convex Hull of a Function?
- Full convergence of the steepest descent method with inexact line searches
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Convergence Rate Analysis of Several Splitting Schemes
- Alternating Proximal Regularized Dictionary Learning
- Signal Recovery by Proximal Forward-Backward Splitting
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Composite Self-Concordant Minimization
- Convex programming in Hilbert space
- The Gradient Projection Method under Mild Differentiability Conditions
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
