Quadratic Convergence of a Newton Method for Nonlinear Programming
File(s):
- TR146.pdf (1.243Mb PDF)
- Author(s)
- Publisher
- University of Wisconsin-Madison Department of Computer Sciences
- Date
- Mar 15, 2012
- 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.
- Permanent link
- http://digital.library.wisc.edu/1793/57738
- Export
- Export to RefWorks