An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications
From MaRDI portal
Publication:2133344
Recommendations
- 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
- New inertial forward-backward algorithm for convex minimization with applications
- On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
- On the convergence of the forward-backward splitting method with linesearches
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A general iterative method for hierarchical variational inequality problems in Hilbert spaces and applications
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A parallel inertial S-iteration forward-backward algorithm for regression and classification problems
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
- An EM algorithm for wavelet-based image restoration
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Convex analysis and monotone operator theory in Hilbert spaces
- Convexity, monotonicity, and gradient processes in Hilbert space
- Fast first-order methods for composite convex optimization with backtracking
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- Iterative oblique projection onto convex sets and the split feasibility problem
- Monotone Operators and the Proximal Point Algorithm
- On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
- On the convergence of the forward-backward splitting method with linesearches
- On the maximal monotonicity of subdifferential mappings
- Signal Recovery by Proximal Forward-Backward Splitting
- Some methods of speeding up the convergence of iteration methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
Cited in
(5)- 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 note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives
- On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
- A New Accelerated Viscosity Forward-backward Algorithm with a Linesearch for Some Convex Minimization Problems and its Applications to Data Classification
This page was built for publication: An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133344)
