A general iterative method for minimizing the sum of two convex functions

MaRDI QIDQ4644031zbMATH OpenFDO

Authors Kan Buranakorn, Somyot Plubtieng

Publication date 30 May 2018

Full work available at URL http://www.yokohamapublishers.jp/online2/opjnca/vol18/2033.html

zbMATH Keywords

strong convergencevariational inequalityviscosity approximation methodconvex optimization problemsproximal gradient algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25)

Recommendations

• A general iterative method for solving constrained convex minimization problems
• General viscosity iterative approximation for solving unconstrained convex optimization problems
• scientific article; zbMATH DE number 854129
• Iterative methods for constrained convex minimization problem in Hilbert spaces
• General iterative scheme based on the regularization for solving a constrained convex minimization problem

Cited in

(5)

• scientific article; zbMATH DE number 220318 (Why is no real title available?)
• General viscosity iterative approximation for solving unconstrained convex optimization problems
• A Moreau-Yosida regularization of a difference of two convex functions
• scientific article; zbMATH DE number 7652690 (Why is no real title available?)
• scientific article; zbMATH DE number 7071979 (Why is no real title available?)

This page was built for publication: A general iterative method for minimizing the sum of two convex functions

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