On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization

DOI10.1002/MMA.5420zbMATH Open1461.65162OpenAlexW2908987494MaRDI QIDQ5378462FDOQ5378462

Authors: Kunrada Kankam, Nattawut Pholasa, Prasit Cholamjiak 

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

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

zbMATH Keywords

convex minimizationconvergence analysiscomplexity analysisforward-backward method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Cited In (33)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Common solution for a finite family of minimization problem and fixed point problem for a pair of demicontractive mappings in Hadamard spaces
• Title not available (Why is that?)
• STRONG CONVERGENCE OF A GENERAL VISCOSITY EXPLICIT RULE FOR THE SUM OF TWO MONOTONE OPERATORS IN HILBERT SPACES
• A novel Noor iterative method of operators with property (\(E\)) as concerns convex programming applicable in signal recovery and polynomiography
• Convex minimization problems based on an accelerated fixed point algorithm with applications to image restoration problems
• New iterative methods for nonlinear operators as concerns convex programming applicable in differential problems, image deblurring, and signal recovering problems
• Monotone inclusion problem and fixed point problem of a generalized demimetric mapping in CAT(0) spaces
• New inertial forward-backward algorithm for convex minimization with applications
• On Halpern's proximal point algorithm in \(p\)-uniformly convex metric spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• An iterative algorithm for the system of split mixed equilibrium problem
• Iterative methods for solving monotone variational inclusions without prior knowledge of the Lipschitz constant of the single-valued operator
• A modified proximal point algorithm for a nearly asymptotically quasi-nonexpansive mapping with an application
• A modified inertial viscosity algorithm for an infinite family of nonexpansive mappings and its application to image restoration
• Title not available (Why is that?)
• A multi-step approximant for fixed point problem and convex optimization problem in Hadamard spaces
• 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
• The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces
• 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?)
• A modified inertial projected forward-backward algorithm for convex optimization problems
• A parallel monotone hybrid algorithm for a finite family of \(G\)-nonexpansive mappings in Hilbert spaces endowed with a graph applicable in signal recovery
• Novel forward-backward algorithms for optimization and applications to compressive sensing and image inpainting
• Bounded perturbation resilience of viscosity proximal algorithm for solving split variational inclusion problems with applications to compressed sensing and image recovery
• Stability of quasi-simple heteroclinic cycles
• A strong convergence theorem for a zero of the sum of a finite family of maximally monotone mappings

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)