An \(O(n)\) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions
DOI10.1016/j.camwa.2009.04.003zbMath1189.62118OpenAlexW2025595543MaRDI QIDQ980027
Ming-Hong Liu, Vasant A. Ubhaya
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.04.003
least squares regressionisotonic regressionlinear time algorithmsumbrella orderinggreatest convex minorant (GCM)integer quasi-convex regressioninteger umbrella regressioninteger unimodal regressionleast concave majorant (LCM)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unimodal regression via prefix isotonic regression
- Linear time algorithms for convex and monotone approximation
- Linear time isotonic and unimodal regression in the \(L_{1}\) and \(L_{\infty }\) norms
- An O(n) algorithm for least squares quasi-convex approximation
- An algorithm for discrete approximation by quasi-convex functions on \(R^m\)
- O(n) algorithms for discrete n-point approximation by quasi-convex functions
- Best approximation by integer-valued functions
- Least-Squares Fitting by Monotonic Functions Having Integer Values
- Integer Isotone Optimization
- Minimizing Separable Convex Functions Subject to Simple Chain Constraints
- Another Proof that Convex Functions are Locally Lipschitz
- Notions of convexity
- Best approximation in inner product spaces
This page was built for publication: An \(O(n)\) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions
