A convergence analysis result for constrained convex minimization problem
From MaRDI portal
Publication:3453420
DOI10.1080/02331934.2013.840620zbMath1326.47098OpenAlexW2116203212MaRDI QIDQ3453420
Publication date: 27 November 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.840620
Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15)
Related Items
Cites Work
- Unnamed Item
- A regularized gradient projection method for the minimization problem
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Averaged mappings and the gradient-projection algorithm
- Strong convergence theorems for resolvents of accretive operators in Banach spaces
- 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
- 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
- Convergence properties of projection and contraction methods for variational inequality problems
- Iterative solution of nonlinear equations involving set-valued uniformly accretive operators.