A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
type: Item
instance of: scholarly article
title: A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
zbMATH Open document ID: 1384.90119
DOI: 10.1080/02331934.2016.1193738
author: Ming Tian
author: Si-Wen Jiao
published in: Optimization
publication date: 2016-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C48
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6661953
zbMATH Keywords: variational inequality
zbMATH Keywords: general iterative algorithms
zbMATH Keywords: equilibrium
zbMATH Keywords: constrained convex minimization
zbMATH Keywords: regularization methods
zbMATH Keywords: fixed point
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/02331934.2016.1193738
OpenAlex ID: W2515347265
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: Strong convergence of the CQ method for fixed point iteration processes
cites work: Averaged mappings and the gradient-projection algorithm
cites work: An alternating projection that does not converge in norm
cites work: Equilibrium programming using proximal-like algorithms
cites work: Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
cites work: An explicit method for systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings
cites work: CONVERGENCE ANALYSIS ON HYBRID PROJECTION ALGORITHMS FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS
cites work: A general iterative algorithm for nonexpansive mappings in Hilbert spaces
cites work: A general iterative method for nonexpansive mappings in Hilbert spaces
cites work: Viscosity approximation methods for nonexpansive mappings
cites work: Some iterative methods for finding fixed points and for solving constrained convex minimization problems
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
cites work: Solving the split feasibility problem without prior knowledge of matrix norms
cites work: Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: A note on the CQ algorithm for the split feasibility problem
cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
cites work: The relaxed CQ algorithm solving the split feasibility problem
cites work: Generalized KM theorems and their applications
description: scientific article; zbMATH DE number 6661953