Pages that link to "Item:Q792060"
From MaRDI portal
The following pages link to Linear time algorithms for convex and monotone approximation (Q792060):
Displaying 11 items.
- An \(O(n)\) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions (Q980027) (← links)
- Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103) (← links)
- Lipschitz condition in minimum norm problems on bounded functions (Q1067133) (← links)
- Quasi-convex optimization (Q1078102) (← links)
- Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765) (← links)
- Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
- Approximation complexity for piecewise monotone functions and real data (Q1323607) (← links)
- A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints (Q2124795) (← links)
- O(n) algorithms for discrete n-point approximation by quasi-convex functions (Q2266345) (← links)
- Linear approximation method preserving \(k\)-monotonicity (Q2630583) (← links)
- An algorithm for linearizing convex extremal problems (Q3577772) (← links)
