Combining and scaling descent and negative curvature directions Articles uri icon

publication date

  • January 2011

start page

  • 285

end page

  • 319

issue

  • 1-2

volume

  • 128

international standard serial number (ISSN)

  • 0025-5610

abstract

  • The aim of this paper is the study of different approaches to combine and scale, in an efficient manner, descent information for the solution of unconstrained optimization problems. We consider the situation in which different directions are available in a given iteration, and we wish to analyze how to combine these directions in order to provide a method more efficient and robust than the standard Newton approach. In particular, we will focus on the scaling process that should be carried out before combining the directions. We derive some theoretical results regarding the conditions necessary to ensure the convergence of combination procedures following schemes similar to our proposals. Finally, we conduct some computational experiments to compare these proposals with a modified Newton's method and other procedures in the literature for the combination of information.

keywords

  • line search; negative curvature; nonconvex optimization