About This Item

Ask the MINDS@UW Librarian

Quadratic Convergence of a Newton Method for Nonlinear Programming

Show simple item record

File(s):

Files Size Format View
TR146.pdf 1.243Mb application/pdf View/Open
Key Value Language
dc.contributor.author Mangasarian, Olvi en_US
dc.date.accessioned 2012-03-15T16:21:12Z
dc.date.available 2012-03-15T16:21:12Z
dc.date.created 1972 en_US
dc.date.issued 1972
dc.identifier.citation TR146
dc.identifier.uri http://digital.library.wisc.edu/1793/57738
dc.description.abstract A Newton algorithm for solving the problem minimize f(x) subject to g(x) - 0, where f:Rn - R and g:Rn - Rm is given for the case when g is concave. At each step a convex quadractic program with linear constraints is solved by means of a finite algorithm to obtain the next point. Quadratic convergence is established. en_US
dc.description.provenance Made available in DSpace on 2012-03-15T16:21:12Z (GMT). No. of bitstreams: 1 TR146.pdf: 1243341 bytes, checksum: 90b1cc063240fe684aef18fb6ea3677e (MD5) en
dc.description.provenance Create and Issued dates reconciled by Wendt Commons staff on 2014-[April]-[7] (MH). en_US
dc.format.mimetype application/pdf en_US
dc.publisher University of Wisconsin-Madison Department of Computer Sciences en_US
dc.title Quadratic Convergence of a Newton Method for Nonlinear Programming en_US
dc.type Technical Report en_US

Part of

Show simple item record