Show simple item record

dc.contributor.authorColeman, Thomas F.en_US
dc.contributor.authorLiu, Jianguoen_US
dc.date.accessioned2007-04-23T16:32:53Z
dc.date.available2007-04-23T16:32:53Z
dc.date.issued1993-10en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1388en_US
dc.identifier.urihttps://hdl.handle.net/1813/6166
dc.description.abstractQuadratic 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.en_US
dc.format.extent2937201 bytes
dc.format.extent632922 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleAn Interior Newton Method for Quadratic Programmingen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics