A modified inertial projected forward-backward algorithm for convex optimization problems

DOI10.1007/S12215-024-01134-ZMaRDI QIDQ6671851zbMATH OpenFDO

Authors Kunrada Kankam, Papatsara Inkrong, Prasit Cholamjiak

Publication date 27 January 2025

Published in Rendiconti del Circolo Matematico di Palermo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12215-024-01134-Z

zbMATH Keywords

constrained convex minimization problemimage recoveryprojected forward-backward method

Mathematics Subject Classification ID

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

Recommendations

• 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
• Double inertial proximal gradient algorithms for convex optimization problems and applications
• New proximal type algorithms for convex minimization and its application to image deblurring
• A fast viscosity forward-backward algorithm for convex minimization problems with an application in image recovery

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A new projection algorithm for variational inclusion problems and its application to cervical cancer disease prediction
• A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions
• An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
• An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces
• Convergence of a splitting inertial proximal method for monotone operators
• Convex analysis and monotone operator theory in Hilbert spaces
• Inertial forward-backward splitting method in Banach spaces with application to compressed sensing
• 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
• Shrinking projection methods involving inertial forward-backward splitting methods for inclusion problems
• Some methods of speeding up the convergence of iteration methods
• Strong convergence of the forward–backward splitting algorithms via linesearches in Hilbert spaces
• The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than 1/k^2

Cited in

(1)

• Novel algorithms based on forward-backward splitting technique: effective methods for regression and classification

This page was built for publication: A modified inertial projected forward-backward algorithm for convex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671851)