Show simple item record

dc.contributor.authorRoma, M.
dc.contributor.authorLucidi, S.
dc.contributor.authorFerris, Michael
dc.date.accessioned2013-01-28T19:21:33Z
dc.date.available2013-01-28T19:21:33Z
dc.date.issued1995-03-20
dc.identifier.citation94-16en
dc.identifier.urihttp://digital.library.wisc.edu/1793/64586
dc.description.abstractWe present a new algorithmic framework for solving unconstrained minimization problems that incorporates a curvilinear linesearch. The search direction used in our framework is a combination of an approximate Newton direction and a direction of negative curvature. Global convergence to a stationary point where the Hessian matrix is positive semidefinite is a exhibited for this class of algorithms by means of a nonmonotone stabilization strategy. An implementation using the Bunch-Parlett decomposition is shown to outperform several other techniques on a large class of test problems.en
dc.subjectunconstrained optimizationen
dc.titleNonmonotone Curvilinear Line Search Methods for Unconstrained Optimizationen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Math Prog Technical Reports
    Math Prog Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record