✦ LIBER ✦

Modified gradient method for minimization of nonsmooth penalty functions

✍ Scribed by Yu. M. Danilin; D. Numazarov

Publisher: Springer US
Year: 1994
Tongue: English
Weight: 198 KB
Volume: 71
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf02114049

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stochastic penalty function methods for

Stochastic penalty function methods for nonsmooth constrained minimization

✍ H. Xu 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 541 KB

Reduced-gradient method for minimization

Reduced-gradient method for minimization of a nonsmooth quasiconvex function

✍ Z. R. Gabidullina 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 170 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

Combined subgradient monotone methods fo

Combined subgradient monotone methods for minimization of nonsmooth functions

✍ N. D. Chepurnoi 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 446 KB

Study on a memory gradient method for th

Study on a memory gradient method for the minimization of functions

✍ A. Miele; J. W. Cantrell 📂 Article 📅 1969 🏛 Springer 🌐 English ⚖ 628 KB

Study on a supermemory gradient method f

Study on a supermemory gradient method for the minimization of functions

✍ E. E. Cragg; A. V. Levy 📂 Article 📅 1969 🏛 Springer 🌐 English ⚖ 696 KB