✦ LIBER ✦

Algorithms for minimizing strictly convex functionals

✍ Scribed by M.N. Yakovlev

Publisher: Elsevier Science
Year: 1967
Weight: 190 KB
Volume: 7
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(67)90020-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subgradient relaxation method for minimi

Subgradient relaxation method for minimization of strictly convex functions

✍ I. Ya. Zabotin; M. I. Kreinin 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 319 KB

Fundamental algorithm for minimizing con

Fundamental algorithm for minimizing convex functions

✍ S. V. Rzhevskii 📂 Article 📅 1979 🏛 Springer US 🌐 English ⚖ 210 KB

Coordinatewise domain scaling algorithm

Coordinatewise domain scaling algorithm for M-convex function minimization

✍ Akihisa Tamura 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 182 KB

Dual coordinate ascent methods for non-s

Dual coordinate ascent methods for non-strictly convex minimization

✍ Paul Tseng 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 958 KB

A VU-algorithm for convex minimization

✍ Robert Mifflin; Claudia Sagastizábal 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 278 KB

For convex minimization we introduce an algorithm based on VU-space decomposition. The method uses a bundle subroutine to generate a sequence of approximate proximal points. When a primal-dual track leading to a solution and zero subgradient pair exists, these points approximate the primal track poi

Random algorithms for convex minimizatio

Random algorithms for convex minimization problems

✍ Angelia Nedić 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 349 KB