Combining and scaling descent and negative curvature directions

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.

[1]  J. Bunch,et al.  Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations , 1971 .

[2]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[3]  Danny C. Sorensen,et al.  On the use of directions of negative curvature in a modified newton method , 1979, Math. Program..

[4]  Richard H. Byrd,et al.  Approximate solution of the trust region problem by minimization over two-dimensional subspaces , 1988, Math. Program..

[5]  Javier M. Moguerza,et al.  An augmented Lagrangian interior-point method using directions of negative curvature , 2003, Math. Program..

[6]  Susana San Matías Izquierdo,et al.  Un método de búsqueda lineal con direcciones combinadas para optimizacón irrestringida , 2001 .

[7]  E. Polak,et al.  A second-order method for the general nonlinear programming problem , 1978 .

[8]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[9]  S. Lucidi,et al.  Exploiting negative curvature directions in linesearch methods for unconstrained optimization , 2000 .

[10]  Javier M. Moguerza,et al.  Combining search directions using gradient flows , 2003, Math. Program..

[11]  W. Murray,et al.  Newton methods for large-scale linear equality-constrained minimization , 1993 .

[12]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[13]  Javier M. Moguerza,et al.  Nonconvex optimization using negative curvature within a modified linesearch , 2008, Eur. J. Oper. Res..

[14]  Xiaoqi Yang,et al.  Quadratic cost flow and the conjugate gradient method , 2005, Eur. J. Oper. Res..

[15]  E. Vercher,et al.  A Generalized Conjugate Gradient Algorithm , 1998 .

[16]  Trond Steihaug.  Practical methods of optimization volume 1 : Unconstrained optimization, by R. Flet-cher, Wiley, New York, 1980, 120 pp. Price: $24.50 , 1982, Networks.

[17]  Nicholas I. M. Gould,et al.  CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.

[18]  I M GouldNicholas,et al.  CUTEr and SifDec , 2003 .

[19]  Philip E. Gill,et al.  Newton-type methods for unconstrained and linearly constrained optimization , 1974, Math. Program..

[20]  Philip E. Gill,et al.  Practical optimization , 1981 .

[21]  Donald Goldfarb,et al.  Curvilinear path steplength algorithms for minimization which use directions of negative curvature , 1980, Math. Program..

[22]  William W. Hager,et al.  A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search , 2005, SIAM J. Optim..