Pages that link to "Item:Q1132491"
From MaRDI portal
The following pages link to An O(n) algorithm for discrete n-point convex approximation with applications to continuous case (Q1132491):
Displaying 12 items.
- Linear time algorithms for convex and monotone approximation (Q792060) (← links)
- Best piecewise monotone uniform approximation (Q808361) (← links)
- Uniform approximation by quasi-convex and convex functions (Q913166) (← links)
- Lipschitz condition in minimum norm problems on bounded functions (Q1067133) (← links)
- Quasi-convex optimization (Q1078102) (← links)
- Optimal Lipschitzian selection operator in quasi-convex optimization (Q1096545) (← links)
- An O(n) algorithm for least squares quasi-convex approximation (Q1097626) (← links)
- A duality approach to best uniform convex approximation (Q1192528) (← links)
- Generalized isotone optimization with applications to starshaped functions (Q1250678) (← links)
- Nonlinear programming, approximation, and optimization on infinitely differentiable functions (Q1251188) (← links)
- \(L_ p\)-approximation from nonconvex subsets of special classes of functions (Q1825392) (← links)
- O(n) algorithms for discrete n-point approximation by quasi-convex functions (Q2266345) (← links)
