Descent methods for convex optimization problems in Banach spaces

M. S. S. Ali

International Journal of Mathematics and Mathematical Sciences, 2005, vol. 2005, 1-11

Abstract:

We consider optimization problems in Banach spaces, whose cost functions are convex and smooth, but do not possess strengthened convexity properties. We propose a general class of iterative methods, which are based on combining descent and regularization approaches and provide strong convergence of iteration sequences to a solution of the initial problem.

Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2005/484251.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2005/484251.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:484251

DOI: 10.1155/IJMMS.2005.2347

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().