Regularized gradient-projection methods for equilibrium and constrained convex minimization problems

DOI10.1186/1029-242X-2013-243zbMath1305.65147WikidataQ59301446 ScholiaQ59301446MaRDI QIDQ2637541

Ming Tian, Li-Hua Huang

Publication date: 12 February 2014

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1029-242x-2013-243

zbMATH Keywords

fixed point; variational inequality; iterative method; equilibrium; constrained convex minimization

Mathematics Subject Classification ID

47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.

65J15: Numerical solutions to equations with nonlinear operators

Cites Work

• An explicit method for systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• Averaged mappings and the gradient-projection algorithm
• Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
• A multiprojection algorithm using Bregman projections in a product space
• An alternating projection that does not converge in norm
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
• Viscosity approximation methods for nonexpansive mappings
• Viscosity approximation methods for fixed-points problems
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• A general iterative method for nonexpansive mappings in Hilbert spaces
• Strong convergence of the CQ method for fixed point iteration processes
• CONVERGENCE ANALYSIS ON HYBRID PROJECTION ALGORITHMS FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS
• Projection methods for variational inequalities with application to the traffic assignment problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• On Projection Algorithms for Solving Convex Feasibility Problems