Variant Gradient Projection Methods for the Minimization Problems
The gradient projection algorithm plays an important role in solving constrained convex minimization problems. In general, the gradient projection algorithm has only weak convergence in infinite-dimensional Hilbert spaces. Recently, H. K. Xu (2011) provided two modified gradient projection algorithm...
Saved in:
| Main Authors: | Yonghong Yao, Yeong-Cheng Liou, Ching-Feng Wen |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2012/792078 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Composite Algorithms for Minimization over the Solutions of Equilibrium Problems and Fixed Point Problems
by: Yonghong Yao, et al.
Published: (2010-01-01) -
On Solving of Constrained Convex Minimize Problem Using Gradient Projection Method
by: Taksaporn Sirirut, et al.
Published: (2018-01-01) -
Extended Extragradient Methods for Generalized Variational Inequalities
by: Yonghong Yao, et al.
Published: (2012-01-01) -
Iterative Schemes for Convex Minimization Problems with Constraints
by: Lu-Chuan Ceng, et al.
Published: (2014-01-01) -
Iterative Algorithms Approach to Variational Inequalities and Fixed Point Problems
by: Yeong-Cheng Liou, et al.
Published: (2012-01-01)