Approximation of solutions to constrained convex minimization problem in Hilbert spaces
From MaRDI portal
Publication:496478
DOI10.1007/s10013-014-0091-1zbMath1321.47150OpenAlexW2000658715MaRDI QIDQ496478
Publication date: 22 September 2015
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10013-014-0091-1
Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A regularized gradient projection method for the minimization problem
- Variant gradient projection methods for the minimization problems
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Averaged mappings and the gradient-projection algorithm
- Iterative approximation of fixed points
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Convergence of the gradient projection method for generalized convex minimization
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Geometric properties of Banach spaces and nonlinear iterations
- Two-Metric Projection Methods for Constrained Optimization
- Projected gradient methods for linearly constrained 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
- Shorter Notes: Some Operator Monotone Functions
This page was built for publication: Approximation of solutions to constrained convex minimization problem in Hilbert spaces
