✦ LIBER ✦

Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization

✍ Scribed by P. Tseng

Book ID: 110362022
Publisher: Springer
Year: 2001
Tongue: English
Weight: 116 KB
Volume: 109
Category: Article
ISSN: 0022-3239
DOI: 10.1023/a:1017501703105

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

Convergence of the steepest descent meth

Convergence of the steepest descent method for minimizing quasiconvex functions

✍ K. C. Kiwiel; K. Murty 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 200 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

Convergence of a generalized subgradient

Convergence of a generalized subgradient method for nondifferentiable convex optimization

✍ Sehun Kim; Hyunsil Ahn 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

Variable metric methods for minimizing a

Variable metric methods for minimizing a class of nondifferentiable functions

✍ S. P. Han 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 514 KB

Note on a method of conjugate subgradien

Note on a method of conjugate subgradients for minimizing nondifferentiable functions

✍ Philip Wolfe 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 195 KB