An efficient gradient flow method for unconstrained optimization

  title={An efficient gradient flow method for unconstrained optimization},
  author={Walter Murray and William Behrman},
This dissertation presents a method for unconstrained optimization based upon approximating the gradient flow of the objective function. Under mild assumptions the method is shown to converge to a critical point from any initial point and to converge quadratically in the neighborhood of a solution. Two implementations of the method are presented, one using explicit Hessians and O(n) storage, the other using Hessian-vector products and O(n) storage. These implementations were written in ANSI… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.

Usage summary for selected optimization routines

  • David M. Gay
  • Technical Report CSTR 153, AT&T Bell Laboratories…
  • 1990
Highly Influential
11 Excerpts

Test functions for unconstrained minimization

  • Albert G. Buckley
  • Technical report, Department of Mathematics…
  • 1994
Highly Influential
3 Excerpts

Analysis of the symmetric Lanczos algorithm with reorthogonalization methods

  • Horst D. Simon
  • Linear Algebra Appl.,
  • 1984
1 Excerpt

Similar Papers

Loading similar papers…