Iterative approximation of solutions for constrained convex minimization problem
DOI10.1007/S40065-013-0085-YzbMATH Open1408.47012OpenAlexW2031805929WikidataQ59293578 ScholiaQ59293578MaRDI QIDQ384553FDOQ384553
Authors: Y. Shehu, Olaniyi S. Iyiola, Cyril D. 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
Recommendations
- A convergence analysis result for constrained convex minimization problem
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- An iterative algorithm for fixed point problem and convex minimization problem with applications
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25)
Cites Work
- A multiprojection algorithm using Bregman projections in a product space
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Geometric properties of Banach spaces and nonlinear iterations
- Projection methods for variational inequalities with application to the traffic assignment problem
- Title not available (Why is that?)
- 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
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Iterative Algorithms for Nonlinear Operators
- Solving the split feasibility problem without prior knowledge of matrix norms
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- NONEXPANSIVE NONLINEAR OPERATORS IN A BANACH SPACE
- 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
- Title not available (Why is that?)
- Iterative methods for constrained convex minimization problem in Hilbert spaces
Cited In (13)
- Mann-type approximation scheme for solving a new class of split inverse problems in Hilbert spaces
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
- An iterative algorithm for approximating convex minimization problem
- Title not available (Why is that?)
- Convergence, stability and data dependence results for contraction and nonexpansive mappings by a new four step algorithm
- Title not available (Why is that?)
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- General iterative scheme based on the regularization for solving a constrained convex minimization problem
- An iterative algorithm for fixed point problem and convex minimization problem with applications
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- Title not available (Why is that?)
- Computing minimum norm solution of a specific constrained convex nonlinear problem
This page was built for publication: Iterative approximation of solutions for constrained convex minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384553)
