Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
DOI10.1186/s13660-016-1289-4zbMath1357.58024OpenAlexW2568992082WikidataQ41081466 ScholiaQ41081466MaRDI QIDQ504560
Publication date: 17 January 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-016-1289-4
variational inequalityminimum-normregularized gradient-projection methodthe constrained convex minimization problem
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Variational inequalities (global problems) in infinite-dimensional spaces (58E35) Numerical solutions to equations with nonlinear operators (65J15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
- Extragradient-projection method for solving constrained convex minimization problems
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Averaged mappings and the gradient-projection algorithm
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- An iterative approach to quadratic optimization
- An alternating projection that does not converge in norm
- Viscosity approximation methods for nonexpansive mappings
- Viscosity approximation methods for fixed-points problems
- Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
- A general iterative method for nonexpansive mappings in Hilbert spaces
- Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
- Iterative Algorithms for Nonlinear Operators
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space
- General iterative methods for equilibrium and constrained convex minimization problem
This page was built for publication: Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem