✦ LIBER ✦

Random algorithms for convex minimization problems

✍ Scribed by Angelia Nedić

Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 349 KB
Volume: 129
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-011-0468-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence of some algorithms for conve

Convergence of some algorithms for convex minimization

✍ Rafael Correa; Claude Lemaréchal 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 776 KB

An algorithm for linearly constrained co

An algorithm for linearly constrained convex nondifferentiable minimization problems

✍ Krzysztof C Kiwiel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 595 KB

Convergence of random minimization algor

Convergence of random minimization algorithms

✍ O. V. Guseva 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 446 KB

Algorithms for minimizing strictly conve

Algorithms for minimizing strictly convex functionals

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

Fundamental algorithm for minimizing con

Fundamental algorithm for minimizing convex functions

✍ S. V. Rzhevskii 📂 Article 📅 1979 🏛 Springer US 🌐 English ⚖ 210 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