✦ LIBER ✦

On minimizing the number of ADMs—Tight bounds for an algorithm without preprocessing

✍ Scribed by Michele Flammini; Mordechai Shalom; Shmuel Zaks

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the accelerating property of an algor

✍ P. L. Toint; F. M. Callier 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 751 KB

On the accelerating property of an algor

✍ F. M. Calliee; P. L. Toint 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 149 KB

A new branch and bound algorithm for min

✍ Guochun Tang 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 310 KB

An efficient cut-based algorithm on mini

✍ Jin-Tai Yan 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 297 KB

An algorithm for computing the number of

✍ P.P. Das 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 450 KB

On the convergence of trust region algor

✍ M. J. D. Powell 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 967 KB