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

DOI10.1016/0898-1221(87)90185-4zbMath0635.65009OpenAlexW2072729993MaRDI QIDQ1097626

Vasant A. Ubhaya

Publication date: 1987

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(87)90185-4

zbMATH Keywords

weight functioncurve fittingstatistical estimationquasi-convex functionbest fitparametric formworst-case time complexityleast squares distance function

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical mathematical programming methods (65K05) General nonlinear regression (62J02)

Related Items (8)

Characterizing best isotone approximations in \(L_p\) spaces, \(1 \leq p < \infty\) ⋮ \(L_ p\) approximation by quasi-convex and convex functions ⋮ Uniform approximation by a non-convex cone of continuous functions ⋮ An \(O(n)\) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions ⋮ Fitting a least squares piecewise linear continuous curve in two dimensions ⋮ \(L_ p\)-approximation from nonconvex subsets of special classes of functions ⋮ Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance ⋮ Approximation complexity for piecewise monotone functions and real data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniform approximation by quasi-convex and convex functions
• Lipschitz condition in minimum norm problems on bounded functions
• Quasi-convex optimization
• Optimal Lipschitzian selection operator in quasi-convex optimization
• An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
• Consistency in concave regression
• O(n) algorithms for discrete n-point approximation by quasi-convex functions
• A simple optimal control problem involving approximation by monotone functions
• An efficient algorithm for determining the convex hull of a finite planar set
• Nonmetric multidimensional scaling. A numerical method
• Note—A Note on Least Squares Fitting of Functions Constrained to be Either Nonnegative, Nondecreasing or Convex
• Least-Squares Fitting by Monotonic Functions Having Integer Values
• Technical Note—On the Estimation of Convex Functions
• Seven Kinds of Convexity
• Point Estimates of Ordinates of Concave Functions

This page was built for publication: An O(n) algorithm for least squares quasi-convex approximation