Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6166
Title: An Interior Newton Method for Quadratic Programming
Authors: Coleman, Thomas F.
Liu, Jianguo
Keywords: computer science
technical report
Issue Date: Oct-1993
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1388
Abstract: Quadratic programming represents an extremely important class of optimization problem. In this paper, we propose a new (interior) approach for the general quadratic programming problem. We establish that our new method is globally and quadratically convergent - published alternative interior approaches do not share such strong convergence properties for the nonconvex case. We also report on the results of preliminary numerical experiments: the results indicate that the proposed method has considerable practical potential.
URI: http://hdl.handle.net/1813/6166
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
93-1388.pdf2.87 MBAdobe PDFView/Open
93-1388.ps618.09 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us