Abstract
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for nonlinear programming. Where possible the symmetric rank one update formula is used, but when this is not possible a new rank two update is used, which is not in the Broyden family, although invariance under linear transformations of the variables is preserved. The representation provides a limited memory capability, and there is an ordering scheme which enables’ old’ information to be deleted when the memory is full. Hereditary and conjugacy properties are preserved to the maximum extent when minimizing a quadratic function subject to linear constraints. Practical experience is described on small (and some larger) CUTE test problems, and is reasonably encouraging, although there is some evidence of slow convergence on large problems with large null spaces.
Chapter PDF
Similar content being viewed by others
References
M.C. van Beurden. Integro-differential equations for electromagnetic scattering: analysis and computation for objects with electric contrast. Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, 2003.
P.T. Boggs, J.W. Tolle and P. Wang. On the local convergence of quasi-Newton methods for constrained optimization. S1AM J. Control and Optimization. 20:161–171, 1982.
A.R. Conn, N.I.M. Gould and Ph.L. Toint. An introduction to the structure of large scale nonlinear optimization problems and the LANCELOT project. In Computing Methods in Applied Sciences and Engineering. R. Glowinski and A. Lichnewsky, eds, SIAM Publications, Philadelphia, 1990.
A.R. Conn, N.I.M. Gould and Ph.L. Toint. Convergence of quasi-Newton matrices generated by the symmetric rank one update. Mathematical Programming. 50:177–196, 1991.
R. Fletcher. Practical Methods of Optimization. Wiley, Chichester, 1987.
R. Fletcher and S. Leyffer. Nonlinear Programming Without a Penalty Function. Mathematical Programming. 91:239–269, 2002.
R. Fletcher, S. Leyffer and Ph.L. Toint. On the Global Convergence of a Filter-SQP Algorithm. SIAM J. Optimization., 13:44–59, 2002.
P.E. Gill, W. Murray, M.A. Saunders. SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization. SIAM J. Optimization. 12:979–1006, 2002.
J. Nocedal. Updating quasi-Newton matrices with limited storage. Mathematics of Computation. 35:773–782, 1980.
J. Nocedal and M.L. Overton. Projected Hessian updating algorithms for nonlinearly constrained optimization. SIAM J. Numerical Analysis. 22:821–850, 1985.
M.J.D. Powell and Ph.L. Toint. On the estimation of sparse Hessian matrices. SIAM J. Numerical Analysis. 16:1060–1074, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Fletcher, R. (2006). A New Low Rank Quasi-Newton Update Scheme for Nonlinear Programming. In: Ceragioli, F., Dontchev, A., Futura, H., Marti, K., Pandolfi, L. (eds) System Modeling and Optimization. CSMO 2005. IFIP International Federation for Information Processing, vol 199. Springer, Boston, MA. https://doi.org/10.1007/0-387-33006-2_25
Download citation
DOI: https://doi.org/10.1007/0-387-33006-2_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-32774-7
Online ISBN: 978-0-387-33006-8
eBook Packages: Computer ScienceComputer Science (R0)