Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
type: Item
instance of: scholarly article
title: Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
zbMATH Open document ID: 1357.58024
author: Ming Tian
author: Hui-Fang Zhang
published in: Journal of Inequalities and Applications
publication date: 2017-01-17T00:00:00Z
Mathematics Subject Classification ID: 58E35
Mathematics Subject Classification ID: 47H09
Mathematics Subject Classification ID: 65J15
zbMATH DE Number: 6675391
zbMATH Keywords: regularized gradient-projection method
zbMATH Keywords: minimum-norm
zbMATH Keywords: the constrained convex minimization problem
zbMATH Keywords: variational inequality
MaRDI profile type: Publication
full work available at URL: s13660-016-1289-4
OpenAlex ID: W2568992082
Wikidata QID: Q41081466
cites work: Some iterative methods for finding fixed points and for solving constrained convex minimization problems
cites work: Extragradient-projection method for solving constrained convex minimization problems
cites work: Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
cites work: Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
cites work: Iterative Algorithms for Nonlinear Operators
cites work: An iterative approach to quadratic optimization
cites work: Quadratic optimization of fixed points of nonexpansive mappings in hubert space
cites work: Viscosity approximation methods for fixed-points problems
cites work: The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
cites work: A general iterative method for nonexpansive mappings in Hilbert spaces
cites work: A general iterative algorithm for nonexpansive mappings in Hilbert spaces
cites work: General iterative methods for equilibrium and constrained convex minimization problem
cites work: Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
cites work: Averaged mappings and the gradient-projection algorithm
cites work: Q5410447
cites work: Nonlinear functional analysis. Fixed point theory and its applications
cites work: An alternating projection that does not converge in norm
cites work: Viscosity approximation methods for nonexpansive mappings
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
DOI: 10.1186/S13660-016-1289-4
description: scientific article; zbMATH DE number 6675391