skip to main content
Department of Computer Science University of Colorado Boulder
cu: home | engineering | mycuinfo | about | cu a-z | search cu | contact cu cs: about | calendar | directory | catalog | schedules | mobile | contact cs
home · events · thesis defenses · 2009-2010 · 

Thesis Defense - Crumly

ECOT 831

On the Reliability of Newton's Method in the Presence of Singularity
Daniel L. Crumly
Computer Science PhD Candidate

It is well known that Newton's method for optimization and nonlinear systems is very well behaved when the approximate Hessian or Jacobian has bounded condition number and is Lipschitz continuous. However, when the approximate Hessian or Jacobian is singular on the domain, much less is known about the behavior of Newton's method.

This thesis builds upon existing theory to formalize more precisely when Newton's method for optimization is expected to be globally convergent when the approximate Hessian is nearly singular. Furthermore, it provides additional context for understanding when Newton's method for nonlinear systems is likely to fail when the Jacobian is singular.

In an effort to mitigate the issues of Newton's method with a line search for nonlinear systems, this work introduces a new approach using inspiration from trust region algorithms for optimization. This approach is shown to both reduce the rate of failure when compared to competing methods and perform well on a battery of test problems.

Committee: Richard Byrd, Professor (Chair)
Xiao-Chuan Cai, Professor
Elizabeth Jessup, Professor
Henry Tufo, Associate Professor
Thomas Manteuffel, Department of Applied Mathematics

See also:
Department of Computer Science
College of Engineering and Applied Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA
Send email to

Engineering Center Office Tower
ECOT 717
FAX +1-303-492-2844
XHTML 1.0/CSS2 ©2012 Regents of the University of Colorado
Privacy · Legal · Trademarks
May 5, 2012 (13:40)