DESCENT METHODS FOR CONVEX OPTIMIZATION PROBLEMS IN BANACH SPACES
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...
Saved in:
| Published in: | International Journal of Mathematics and Mathematical Sciences Vol. 2005; no. 15; pp. 2347 - 2357-184 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Hindawi Limiteds
01.01.2005
Wiley |
| ISSN: | 0161-1712, 1687-0425 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0161-1712 1687-0425 |
| DOI: | 10.1155/IJMMS.2005.2347 |