On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
From MaRDI portal
Publication:5378462
DOI10.1002/mma.5420zbMath1461.65162OpenAlexW2908987494MaRDI QIDQ5378462
Prasit Cholamjiak, Kunrada Kankam, Nattawut Pholasa
Publication date: 29 May 2019
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mma.5420
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items
An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications ⋮ Convex minimization problems based on an accelerated fixed point algorithm with applications to image restoration problems ⋮ Novel forward-backward algorithms for optimization and applications to compressive sensing and image inpainting ⋮ 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 ⋮ A strong convergence theorem for a zero of the sum of a finite family of maximally monotone mappings ⋮ Bounded perturbation resilience of viscosity proximal algorithm for solving split variational inclusion problems with applications to compressed sensing and image recovery ⋮ New inertial forward-backward algorithm for convex minimization with applications ⋮ New iterative methods for nonlinear operators as concerns convex programming applicable in differential problems, image deblurring, and signal recovering problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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 ⋮ Monotone inclusion problem and fixed point problem of a generalized demimetric mapping in CAT(0) spaces ⋮ Common solution for a finite family of minimization problem and fixed point problem for a pair of demicontractive mappings in Hadamard spaces ⋮ 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 ⋮ A multi-step approximant for fixed point problem and convex optimization problem in Hadamard spaces ⋮ The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces ⋮ STRONG CONVERGENCE OF A GENERAL VISCOSITY EXPLICIT RULE FOR THE SUM OF TWO MONOTONE OPERATORS IN HILBERT SPACES
This page was built for publication: On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
