gradient projection method

gradient projection method

[′grād·ē·ənt prə′jek·shən ‚meth·əd]
(mathematics)
Computational method used in nonlinear programming when constraint functions are linear.
References in periodicals archive ?
Yang, "A Regularized Gradient Projection Method for the Minimization Problem," Journal of Applied Mathematics, vol.
Tianchai, "Gradient projection method with a new step size for the split feasibility problem," Journal of Inequalities and Applications, vol.
Zanni, "A scaled gradient projection method for constrained image deblurring," Inverse Problems, vol.
Second, the sub-problem is solved by an adaptive regularization gradient projection method, characterized by an iterate-varying hyper-ellipsoidal based norm.
Rosen, "The gradient projection method for nonlinear programming.
Luenberger, "The gradient projection method along geodesics," Management Science, vol.
Li, "Spectral gradient projection method for monotone nonlinear equations with convex constraints," Applied Numerical Mathematics, vol.
The generalized gradient projection method. We follow the approach described in [7].
ALGORITHM 2.2 (Generalized gradient projection method).
A family of clustering criteria is introduced, and an alternating optimization algorithm is developed by adapting a gradient projection method to fit each variant of the fuzzy clustering model.
The gradient projection method has many of the same properties as the steepest descent method, including a slow convergence rate.
Recently, similar techniques were tactfully managed to different traditional algorithms [8,10,11,16,17] andcorresponding optimal complexity results were obtained: Beck and Teboulle [10] proposed a fast duality-based gradient projection methods to solve TV; Chambolle and Pock [11] and Goldfarb et al.

Full browser ?