On the convergence of the forward–backward splitting method with linesearches
From MaRDI portal
Publication:2829582
DOI10.1080/10556788.2016.1214959zbMath1354.65116arXiv1501.02501OpenAlexW2513710035MaRDI QIDQ2829582
Tran T. A. Nghia, José Yunier Bello Cruz
Publication date: 8 November 2016
Published in: Optimization Methods and 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) Nonlinear programming (90C30) Complexity and performance of numerical algorithms (65Y20)
Related Items
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, A proximal gradient splitting method for solving convex vector optimization problems, Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization, An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications, Iterative regularization methods with new stepsize rules for solving variational inclusions, Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC, Novel forward-backward algorithms for optimization and applications to compressive sensing and image inpainting, Quadratic growth conditions and uniqueness of optimal solution to Lasso, Forward-backward-forward algorithms involving two inertial terms for monotone inclusions, Strong convergence of the forward–backward splitting algorithms via linesearches in Hilbert spaces, Double inertial proximal gradient algorithms for convex optimization problems and applications, A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems, A modified forward‐backward splitting methods for the sum of two monotone operators with applications to breast cancer prediction, New inertial forward-backward algorithm for convex minimization with applications, Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems, 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, The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions, On the weak and strong convergence of modified forward-backward-half-forward splitting methods, A proximal interior point algorithm with applications to image processing, On FISTA with a relative error rule, Applying FISTA to optimization problems (with or) without minimizers, Unnamed Item, Unnamed Item, Unnamed Item, Inertial methods for fixed point problems and zero point problems of the sum of two monotone mappings, Strong convergence of the forward–backward splitting method with multiple parameters in Hilbert spaces, Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions, Weak convergence of an extended splitting method for monotone inclusions, Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions, On the linear convergence of forward-backward splitting method. I: Convergence analysis, Scaling Techniques for $\epsilon$-Subgradient Methods, 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, A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption, Strong convergence of a forward-backward splitting method with a new step size for solving monotone inclusions, The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces, Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems, New proximal type algorithms for convex minimization and its application to image deblurring
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Gradient methods for minimizing composite functions
- Comments on ``The proximal point algorithm revisited
- A coordinate gradient descent method for nonsmooth separable minimization
- Conditional subgradient optimization -- theory and applications
- The proximal point algorithm revisited
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Minimization of functions having Lipschitz continuous first partial derivatives
- Incremental Subgradient Methods for Nondifferentiable Optimization
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
- Proximal Splitting Methods in Signal Processing
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Entropy-Like Proximal Methods in Convex Programming
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- Signal Recovery by Proximal Forward-Backward Splitting
- Convex analysis and monotone operator theory in Hilbert spaces
- Convergence of a block coordinate descent method for nondifferentiable minimization