✦ LIBER ✦

On a method of coordinate descent

✍ Scribed by V.A. Zhdanov

Publisher: Elsevier Science
Year: 1977
Weight: 425 KB
Volume: 17
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(77)90010-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The method of coordinate descent in cond

The method of coordinate descent in conditional minimization problems

✍ D.V. Denisov 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 195 KB

A coordinate descent method for the bi-l

A coordinate descent method for the bi-level O-D matrix adjustment problem

✍ Michael Florian; Yang Chen 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 677 KB

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

On a global descent method for polynomia

On a global descent method for polynomials

✍ Stephan Ruscheweyh 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 511 KB

On the method of steepest descents

✍ F.H Northover 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 634 KB