𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by V.A. Ubhaya

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
551 KB
Volume
14
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Random walks and an O*(n5) volume algori
Random walks and an O*(n5) volume algorithm for convex bodies
✍ Ravi Kannan; László Lovász; Miklós Simonovits 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 423 KB

Given a high dimensional convex body K: ‫ޒ‬ n by a separation oracle, we can U Ž 5 . approximate its volume with relative error , using O n oracle calls. Our algorithm also brings the body into isotropic position. As all previous randomized volume algorithms, we Ž . use ''rounding'' followed by a mu