✦ LIBER ✦

Incremental proximal methods for large scale convex optimization

✍ Scribed by Dimitri P. Bertsekas

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large-scale convex optimization methods

Large-scale convex optimization methods for air quality policy assessment

✍ D.A. Carlson; A. Haurie; J.-P. Vial; D.S. Zachary 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Proximal quasi-Newton methods for nondif

Proximal quasi-Newton methods for nondifferentiable convex optimization

✍ Xiaojun Chen; Masao Fukushima 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 154 KB

Non-euclidean restricted memory level me

Non-euclidean restricted memory level method for large-scale convex optimization

✍ Aharon Ben-Tal; Arkadi Nemirovski 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 513 KB

Optimization methods for large-scale mul

Optimization methods for large-scale multiechelon stockage problems

✍ Larry J. Leblanc 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 654 KB

Iterative bundle-based decomposition for

Iterative bundle-based decomposition for large-scale nonseparable convex optimization

✍ Koohyun Park; Yong-Sik Shin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 278 KB

There has been considerable research in solving large-scale separable convex optimization problems. In this paper we present an algorithm for large-scale nonseparable smooth convex optimization problems with block-angular linear constraints. The solution of the problem is approximated by solving a s

Generalized proximal point algorithm for

Generalized proximal point algorithm for convex optimization

✍ D. Medhi; C. D. Ha 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 533 KB