Abstract
This article is concerned with the approximation problem of fitting n data points by a quasi-convex function using the least squares distance function. An algorithm of O( n) worst-case time complexity for computing a best fit is developed. This problem arises in the context of curve fitting or statistical estimation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
