Abstract
Recently proposed algorithms for the solution of large quadratic programming problems are reviewed. An important feature of these algorithms is their capability to find an approximate solution of the convex equality and/or bound constrained quadratic programming problems with the uniformly bounded spectrum of the Hessian matrix at O(1) iterations. The theoretical results are presented and illustrated by numerical experiments.
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.
