✦ LIBER ✦

Fundamental algorithm for minimizing convex functions

✍ Scribed by S. V. Rzhevskii

Publisher: Springer US
Year: 1979
Tongue: English
Weight: 210 KB
Volume: 15
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069384

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for minimizing strictly conve

Algorithms for minimizing strictly convex functionals

✍ M.N. Yakovlev 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 190 KB

Coordinatewise domain scaling algorithm

Coordinatewise domain scaling algorithm for M-convex function minimization

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

An algorithm for minimizing Boolean func

An algorithm for minimizing Boolean functions

✍ J. C. Wilson 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 581 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

Minimizing Irregular Convex Functions: U

Minimizing Irregular Convex Functions: Ulam Stability for Approximate Minima

✍ Emil Ernst; Michel A. Théra 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 462 KB