On the convergence of the forward–backward splitting method with linesearches
DOI10.1080/10556788.2016.1214959zbMATH Open1354.65116arXiv1501.02501OpenAlexW2513710035MaRDI QIDQ2829582FDOQ2829582
T. T. A. Nghia, J. Y. Bello Cruz
Publication date: 8 November 2016
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.02501
complexityweak convergenceiteration complexityArmijo-type line searchforward-backward methodnonsmooth and convex optimization problemsproximal gradient splitting method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Gradient methods for minimizing composite functions
- A coordinate gradient descent method for nonsmooth separable minimization
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Proximal Splitting Methods in Signal Processing
- Signal Recovery by Proximal Forward-Backward Splitting
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- The proximal point algorithm revisited
- Minimization of functions having Lipschitz continuous first partial derivatives
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Efficiency of coordinate descent methods on huge-scale optimization problems
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Entropy-Like Proximal Methods in Convex Programming
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Incremental subgradient methods for nondifferentiable optimization
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- Conditional subgradient optimization -- theory and applications
- Comments on ``The proximal point algorithm revisited
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
Cited In (48)
- Strong convergence of the forward–backward splitting algorithms via linesearches in Hilbert spaces
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
- Forward-backward algorithm for functions with locally Lipschitz gradient: applications to mean field games
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions
- A modified forward‐backward splitting methods for the sum of two monotone operators with applications to breast cancer prediction
- A proximal gradient splitting method for solving convex vector optimization problems
- An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration
- Strong convergence of the forward–backward splitting method with multiple parameters in Hilbert spaces
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- Title not available (Why is that?)
- Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization
- Weak convergence of an extended splitting method for monotone inclusions
- New inertial forward-backward algorithm for convex minimization with applications
- Inertial methods for fixed point problems and zero point problems of the sum of two monotone mappings
- Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- Strong convergence of a forward-backward splitting method with a new step size for solving monotone inclusions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A proximal interior point algorithm with applications to image processing
- Iterative methods for solving monotone variational inclusions without prior knowledge of the Lipschitz constant of the single-valued operator
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC
- On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
- On the linear convergence of forward-backward splitting method. I: Convergence analysis
- Quadratic growth conditions and uniqueness of optimal solution to Lasso
- On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems
- Iterative regularization methods with new stepsize rules for solving variational inclusions
- On the weak and strong convergence of modified forward-backward-half-forward splitting methods
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Double inertial proximal gradient algorithms for convex optimization problems and applications
- The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces
- On the linear convergence rate of a relaxed forward–backward splitting method
- An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
- On convergence and complexity analysis of an accelerated forward-backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification
- An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications
- Title not available (Why is that?)
- Scaling techniques for \(\epsilon\)-subgradient methods
- An improved parameterized fast iterative shrinkage-thresholding algorithm with adaptive step size and its applications
- A modified inertial projected forward-backward algorithm for convex optimization problems
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
- Convergence analysis of a variable metric forward-backward splitting algorithm with applications
- Novel forward-backward algorithms for optimization and applications to compressive sensing and image inpainting
- On FISTA with a relative error rule
- New proximal type algorithms for convex minimization and its application to image deblurring
- Applying FISTA to optimization problems (with or) without minimizers
- Forward-backward-forward algorithms involving two inertial terms for monotone inclusions
This page was built for publication: On the convergence of the forward–backward splitting method with linesearches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829582)