On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
From MaRDI portal
Publication:5378462
Recommendations
- An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications
- On the convergence of the forward-backward splitting method with linesearches
- 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 viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
- A new linesearch method for quadratically constrained convex programming
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- Convergence analysis of a modified BFGS method on convex minimizations
- New convergence method with nonmonotone line search
- Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
Cited in
(46)- Monotone inclusion problem and fixed point problem of a generalized demimetric mapping in CAT(0) spaces
- On the linear convergence of forward-backward splitting method. I: Convergence analysis
- A modified proximal point algorithm for a nearly asymptotically quasi-nonexpansive mapping with an application
- 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
- The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces
- An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications
- Novel forward-backward algorithms for optimization and applications to compressive sensing and image inpainting
- A strong convergence theorem for a zero of the sum of a finite family of maximally monotone mappings
- An iterative algorithm for the system of split mixed equilibrium problem
- A parallel monotone hybrid algorithm for a finite family of \(G\)-nonexpansive mappings in Hilbert spaces endowed with a graph applicable in signal recovery
- Common solution for a finite family of minimization problem and fixed point problem for a pair of demicontractive mappings in Hadamard spaces
- New inertial forward-backward algorithm for convex minimization with applications
- On the convergence of the forward-backward splitting method with linesearches
- A double forward-backward algorithm using linesearches for minimization problem
- scientific article; zbMATH DE number 7447340 (Why is no real title available?)
- Strong convergence of the inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces
- Convergence analysis of quasi-variational inclusion and fixed point problems of finite family of certain nonlinear mappings in Hilbert spaces
- Fixed point optimization method for image restoration
- scientific article; zbMATH DE number 7447682 (Why is no real title available?)
- Spectral conjugate gradient like method for signal reconstruction
- Stability of quasi-simple heteroclinic cycles
- An accelerated forward-backward algorithm with applications to image restoration problems
- Convex minimization problems based on an accelerated fixed point algorithm with applications to image restoration problems
- STRONG CONVERGENCE OF A GENERAL VISCOSITY EXPLICIT RULE FOR THE SUM OF TWO MONOTONE OPERATORS IN HILBERT SPACES
- A modified inertial viscosity algorithm for an infinite family of nonexpansive mappings and its application to image restoration
- A modified viscosity iterative method for implicit midpoint rule for optimization and fixed point problems in CAT(0) spaces
- Double inertial proximal gradient algorithms for convex optimization problems and applications
- Inertial proximal gradient method using adaptive stepsize for convex minimization problems
- Bounded perturbation resilience of viscosity proximal algorithm for solving split variational inclusion problems with applications to compressed sensing and image recovery
- New iterative methods for nonlinear operators as concerns convex programming applicable in differential problems, image deblurring, and signal recovering problems
- A novel Noor iterative method of operators with property (\(E\)) as concerns convex programming applicable in signal recovery and polynomiography
- On Halpern's proximal point algorithm in p-uniformly convex metric spaces
- Iterative methods for solving monotone variational inclusions without prior knowledge of the Lipschitz constant of the single-valued operator
- Novel algorithms based on forward-backward splitting technique: effective methods for regression and classification
- A modified inertial projected forward-backward algorithm for convex optimization problems
- Inertial viscosity fixed point algorithms for monotone inclusion, convex minimization, and image restoration problems
- Classifying compressive strength of clay bricks using an inertial projected forward-backward algorithm
- A novel double inertial viscosity algorithm for convex bilevel optimization problems applied to image restoration problems
- A regret bound for the AdaMax algorithm with image segmentation application
- Three-step projected forward-backward algorithms for constrained minimization problem
- A fast forward-backward algorithm using linesearch and inertial techniques for convex bi-level optimization problems with applications
- On the proximal point algorithm of hybrid-type in flat Hadamard spaces with applications
- Two parallel golden ratio iterative algorithms for approximate solution of equilibrium problem in real Hilbert space
- Some generalized forward reflected backward methods for solving convex minimization problems
- A multi-step approximant for fixed point problem and convex optimization problem in Hadamard spaces
This page was built for publication: On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378462)