Iterative method for convex optimization problems in real Lebesgue spaces

M. E. Okpala

Abstract


We introduce a new iterative scheme for finding common fixed points of a finite family of nonextensive mapping and zeros of strongly monotone mappings in Lp spaces, which yields a solution to a convex optimization problem. This provides a partial extension of a theorem of Yamada and some other authors from Hilbert spaces to the more general Banach spaces.


Full Text: PDF

How to Cite this Article:

M. E. Okpala, Iterative method for convex optimization problems in real Lebesgue spaces, Advances in Fixed Point Theory, Vol 6, No 3 (2016), 262-276

Copyright © 2016 M. E. Okpala. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Advances in Fixed Point Theory

ISSN: 1927-6303

Editorial Office: office@scik.org

Copyright ©2019 SCIK Publishing Corporation. All rights reserved.