Iterative approximation of solutions for constrained convex minimization problem

DOI10.1007/s40065-013-0085-yzbMath1408.47012OpenAlexW2031805929WikidataQ59293578 ScholiaQ59293578MaRDI QIDQ384553

Olaniyi Samuel Iyiola, Yekini Shehu, Cyril Dennis Enyi

Publication date: 28 November 2013

Published in: Arabian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40065-013-0085-y

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• A multiprojection algorithm using Bregman projections in a product space
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
• Iterative methods for constrained convex minimization problem in Hilbert spaces
• Geometric properties of Banach spaces and nonlinear iterations
• Iterative Algorithms for Nonlinear Operators
• Solving the split feasibility problem without prior knowledge of matrix norms
• 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
• NONEXPANSIVE NONLINEAR OPERATORS IN A BANACH SPACE

This page was built for publication: Iterative approximation of solutions for constrained convex minimization problem