Pages that link to "Item:Q2266345"

The following pages link to O(n) algorithms for discrete n-point approximation by quasi-convex functions (Q2266345):

Displaying 8 items.

• Best quasi-convex uniform approximation (Q805957) (← links)
• 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)
• An O(n) algorithm for least squares quasi-convex approximation (Q1097626) (← links)
• Uniform approximation by classes of functions closed under translation and pointwise supremum (Q3357638) (← links)
• Uniform approximation by classes of functions closed under translation and pointwise supremum (Q4711099) (← links)