Abstract
In this paper, we propose a new iterative scheme for finding a minimizer of a constrained convex minimization problem and prove that the sequence generated by our new scheme converges strongly to a solution of the constrained convex minimization problem in a real Hilbert space.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
BaillonJ.B.; Haddad G.: Quelques proprietes des operateurs angle-bornes et n-cycliquement monotones. Israel J. Math. 26, 137–150 (1977)
Berinde, V.: Iterative approximation of fixed points. Lecture Notes in Mathematics 1912. Springer, Berlin (2007)
Bertsekas D.P., Gafni E.M.: Projection methods for variational inequalities with applications to the traffic assignment problem. Math. Progr. Stud. 17, 139–159 (1982)
Browder F.E.: Nonexpansive nonlinear mappings in a Banach space. Proc. Nat. Acad. Sci. USA 54, 1041–1044 (1965)
Byrne C.: Unified treatment of some algorithms in signal processing and image construction. Inverse Probl. 20, 103–120 (2004)
Ceng L.C., Ansari Q.H., Yao J.C.: Some iterative methods for finding fixed points and for solving constrained convex minimization problems. Nonlinear Anal. 74, 5286–5302 (2011)
Censor Y., Elfving T.: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8, 221–239 (1994)
Chidume, C.E.: Geometric properties of Banach spaces and nonlinear iterations. Lecture Notes in Mathematics, vol. 1965. Springer-Verlag, London (2009)
Combettes P.L.: Solving monotone inclusion via compositions of nonexpansive averaged operators. Optimization 53, 475–504 (2004)
Goebel, K.; Kirk, W.A.: Topics in metric fixed point theory. Cambridge Studies in Advanced Mathematics, vol. 28. Cambridge University Press, Cambridge (1990)
Han D., Lo H.K.: Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities. Eur. J. Oper. Res. 159, 529–544 (2004)
Iyiola, O.S.: Iterative approximation of fixed points in Hilbert spaces. Lap Lambert Academic Publishing (ISBN 978-3-8443-0609-5) (2012)
Lopez, G.; Martin-Marquez, V.; Wang, F.H.; Xu, H.K: Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl. 28, 085004 (2012)
Maingé P.E.: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal. 16, 899–912 (2008)
Podilchuk C.I., Mammone R.J.: Image recovery by convex projections using a least-squares constraint. J. Opt. Soc. Am. A 7, 517–521 (1990)
Su M., Xu H.K.: Remarks on the gradient-projection algorithm. J. Nonlinear Anal. Optim. 1(1), 35–43 (2010)
Tian, M.; Huang, L.: Iterative methods for constrained convex minimization problem in Hilbert spaces. Fixed Point Theory Appl. doi:10.1186/1687-1812-2013-105 (2013)
Xu H.K.: Averaged mappings and the gradient-projection algorithm. J. Optim. Theory Appl. 150(2), 360–378 (2011)
Xu H.K.: Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 66(2), 240–256 (2002)
Youla D.: On deterministic convergence of iterations of related projection mappings. J. Vis. Commun. Image Represent 1, 12–20 (1990)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This article is published under license to BioMed Central Ltd.Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
About this article
Cite this article
Shehu, Y., Iyiola, O.S. & Enyi, C.D. Iterative approximation of solutions for constrained convex minimization problem. Arab. J. Math. 2, 393–402 (2013). https://doi.org/10.1007/s40065-013-0085-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40065-013-0085-y