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:
Main Author: | M. S. S. Ali |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2005-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/IJMMS.2005.2347 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems
by: Jitsupa Deepho, et al.
Published: (2014-01-01) -
Iterative Methods for Nonconvex Equilibrium Problems in Uniformly Convex and Uniformly Smooth Banach Spaces
by: Messaoud Bounkhel
Published: (2015-01-01) -
On P- and p-Convexity of Banach Spaces
by: Omar Muñiz-Pérez
Published: (2010-01-01) -
Convexity of Solutions for an Iterative Equation in Banach Spaces
by: Xiaobing Gong
Published: (2013-01-01) -
A Generalization of Uniformly Extremely Convex Banach Spaces
by: Suyalatu Wulede, et al.
Published: (2016-01-01)