✦ LIBER ✦

An algorithm for discrete approximation by quasi-convex functions on Rm

✍ Scribed by V.A. Ubhaya

Book ID: 108076918
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 368 KB
Volume: 47
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2004.06.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

O(n) algorithms for discrete n-point app

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

✍ Vasant A. Ubhaya 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 251 KB

An O(n) algorithm for least squares quas

An O(n) algorithm for least squares quasi-convex approximation

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

On Steepest Descent Algorithms for Discr

On Steepest Descent Algorithms for Discrete Convex Functions

✍ Murota, Kazuo 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 132 KB

An optimal sequential algorithm for the

An optimal sequential algorithm for the uniform approximation of convex functions on [0,1]2

✍ G. Sonnevend 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 952 KB

An algorithm for weighted least squares

An algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions

✍ Ming-Hong Liu; Vasant A. Ubhaya 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 572 KB

ordering Isotonic regression Linear time algorithms Greatest convex minorant (GCM) Least concave majorant (LCM) a b s t r a c t The problem of fitting n data points by an integer quasi-convex (also quasi-concave, umbrella or unimodal) function using the weighted least squares distance function is c

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

An O(n) algorithm for discrete n-point convex approximation with applications to continuous case

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