✦ LIBER ✦

O(n) algorithms for discrete n-point approximation by quasi-convex functions

✍ Scribed by Vasant A. Ubhaya

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n) algorithm for discrete n-point c

✍ Vasant A Ubhaya 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 862 KB

An O(n) algorithm for least squares quas

✍ V.A. Ubhaya 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 551 KB

An algorithm for discrete approximation

✍ V.A. Ubhaya 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 368 KB

An O(n3L) primal interior point algorith

✍ D. Goldfarb; S. Liu 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 731 KB