On the relaxed hybrid-extragradient method for solving constrained convex minimization problems in Hilbert spaces

DOI10.11650/TJM.17.2013.2567zbMath1280.49024OpenAlexW2030900355MaRDI QIDQ390066

Lu-Chuan Ceng, Chun-Yen Chou

Publication date: 22 January 2014

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/tjm.17.2013.2567

zbMATH Keywords

strong convergencevariational inequalitynonexpansive mappingvariational inclusionmaximal monotone mappingconstrained convex minimizationinverse strongly monotone mappingrelaxed hybrid-extragradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Variational inequalities (49J40) Monotone operators and generalizations (47H05) Set-valued and variational analysis (49J53) Iterative procedures involving nonlinear operators (47J25) Set-valued operators (47H04) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical methods for variational inequalities and related problems (65K15)

Related Items (2)

Hybrid splitting methods for the system of operator inclusions with monotone operators ⋮ Iterative algorithm of common solutions for a constrained convex minimization problem, a quasi-variational inclusion problem and the fixed point problem of a strictly pseudo-contractive mapping

This page was built for publication: On the relaxed hybrid-extragradient method for solving constrained convex minimization problems in Hilbert spaces