✦ LIBER ✦

Relaxation methods for problems with strictly convex separable costs and linear constraints

✍ Scribed by Paul Tseng; Dimitri P. Bertsekas

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Relaxation methods for the strictly conv

✍ Hiroshi Nagamochi; Masao Fukushima; Toshihide Lbaraki 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 716 KB

An $\epsilon$-Relaxation Method for Sepa

✍ Bertsekas, Dimitri P.; Polymenakos, Lazaros C.; Tseng, Paul 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 336 KB

An ε-relaxation method for separable con

✍ Paul Tseng; Dimitri P. Bertsekas 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 181 KB

Cycle-based algorithms for multicommodit

✍ Mauricio C. de Souza; Philippe Mahey; Bernard Gendron 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

Extragradient-type method for optimal co

✍ Khoroshilova, Elena V. 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 250 KB

Polynomial Methods for Separable Convex

✍ Karzanov, Alexander V.; McCormick, S. Thomas 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 512 KB