On Solving of Constrained Convex Minimize Problem Using Gradient Projection Method
Let C and Q be closed convex subsets of real Hilbert spaces H1 and H2, respectively, and let g:C→R be a strictly real-valued convex function such that the gradient ∇g is an 1/L-ism with a constant L>0. In this paper, we introduce an iterative scheme using the gradient projection method, based on...
Saved in:
| Main Authors: | Taksaporn Sirirut, Pattanapong Tianchai |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2018/1580837 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Iterative Method for Solving the Generalized System of Relaxed Cocoercive Quasivariational Inclusions and Fixed Point Problems of an Infinite Family of Strictly Pseudocontractive Mappings
by: Pattanapong Tianchai, et al.
Published: (2010-01-01) -
Sufficient Descent Conjugate Gradient Methods for Solving Convex Constrained Nonlinear Monotone Equations
by: San-Yang Liu, et al.
Published: (2014-01-01) -
A General Iterative Scheme Based on Regularization for Solving Equilibrium and Constrained Convex Minimization Problems
by: Ming Tian
Published: (2013-01-01) -
Solving Generalized Mixed Equilibria, Variational Inequalities, and Constrained Convex Minimization
by: A. E. Al-Mazrooei, et al.
Published: (2014-01-01) -
Variant Gradient Projection Methods for the Minimization Problems
by: Yonghong Yao, et al.
Published: (2012-01-01)