A Regularized Gradient Projection Method for the Minimization Problem
We investigate the following regularized gradient projection algorithm xn+1=Pc(I−γn(∇f+αnI))xn, n≥0. Under some different control conditions, we prove that this gradient projection algorithm strongly converges to the minimum norm solution of the minimization problem minx∈Cf(x).
Saved in:
Main Authors: | Yonghong Yao, Shin Min Kang, Wu Jigang, Pei-Xia Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/259813 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Regularized Methods for the Split Feasibility Problem
by: Yonghong Yao, et al.
Published: (2012-01-01) -
Algorithmic Approach to a Minimization Problem
by: Yonghong Yao, et al.
Published: (2012-01-01) -
Strong Convergence of a Projected Gradient Method
by: Shunhou Fan, et al.
Published: (2012-01-01) -
Relaxed Viscosity Approximation Methods with Regularization for Constrained Minimization Problems
by: Lu-Chuan Ceng, et al.
Published: (2013-01-01) -
Hybrid Gradient-Projection Algorithm for Solving Constrained Convex Minimization Problems with Generalized Mixed Equilibrium Problems
by: Lu-Chuan Ceng, et al.
Published: (2012-01-01)