✦ LIBER ✦

Block-Coordinate Gradient Descent Method for

✍ Scribed by P. Tseng; S. Yun

Publisher: Springer
Year: 2008
Tongue: English
Weight: 506 KB
Volume: 140
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-008-9458-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A block coordinate gradient descent meth

A block coordinate gradient descent method for regularized convex separable optimization and covariance selection

✍ Sangwoon Yun; Paul Tseng; Kim-Chuan Toh 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 325 KB

A coordinate gradient descent method for

A coordinate gradient descent method for nonsmooth separable minimization

✍ Paul Tseng; Sangwoon Yun 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 425 KB

We consider the problem of minimizing the sum of a smooth function and a separable convex function. This problem includes as special cases bound-constrained optimization and smooth optimization with 1 -regularization. We propose a (block) coordinate gradient descent method for solving this class of

On a method of coordinate descent

✍ V.A. Zhdanov 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 425 KB

Method of generalized gradient descent

✍ V. I. Norkin 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 695 KB

Application of generalized gradient desc

Application of generalized gradient descent in block programming

✍ N. Z. Shor 📂 Article 📅 1970 🏛 Springer US 🌐 English ⚖ 218 KB

Two descent hybrid conjugate gradient me

Two descent hybrid conjugate gradient methods for optimization

✍ Li Zhang; Weijun Zhou 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 183 KB

In this paper, we propose two new hybrid nonlinear conjugate gradient methods, which produce sufficient descent search direction at every iteration. This property depends neither on the line search used nor on the convexity of the objective function. Under suitable conditions, we prove that the prop