✦ LIBER ✦

Approximation to nonproper problems of convex programming

✍ Scribed by A. A. Vatolin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for convex mu

✍ Matthias Ehrgott; Lizhen Shao; Anita Schöbel 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 580 KB

Solution to geometric programming proble

✍ G.S. Dawkins; B.C. McInnis; S.K. Moonat 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Approximate methods for solving problems

✍ Han Chang 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 532 KB

Problems of dynamic convex programming

✍ Yu.P. Ivanilov; A.I. Propoi 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 713 KB

An approximate method for solving the co

✍ M. I. Zhaldak; Yu. V. Trius 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 321 KB

Infinite-dimensional convex programming

✍ V. Jeyakumar 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 960 KB