A New Low Rank Quasi-Newton Update Scheme for Nonlinear Programming

  • R. Fletcher
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 199)


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.


nonlinear programming filter SQP quasi-Newton symmetric rank one limited memory 


  1. [1]
    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.Google Scholar
  2. [2]
    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.MathSciNetCrossRefGoogle Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    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.MathSciNetCrossRefGoogle Scholar
  5. [5]
    R. Fletcher. Practical Methods of Optimization. Wiley, Chichester, 1987.Google Scholar
  6. [6]
    R. Fletcher and S. Leyffer. Nonlinear Programming Without a Penalty Function. Mathematical Programming. 91:239–269, 2002.MathSciNetCrossRefGoogle Scholar
  7. [7]
    R. Fletcher, S. Leyffer and Ph.L. Toint. On the Global Convergence of a Filter-SQP Algorithm. SIAM J. Optimization., 13:44–59, 2002.MathSciNetCrossRefGoogle Scholar
  8. [8]
    P.E. Gill, W. Murray, M.A. Saunders. SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization. SIAM J. Optimization. 12:979–1006, 2002.MathSciNetCrossRefGoogle Scholar
  9. [9]
    J. Nocedal. Updating quasi-Newton matrices with limited storage. Mathematics of Computation. 35:773–782, 1980.MATHMathSciNetCrossRefGoogle Scholar
  10. [10]
    J. Nocedal and M.L. Overton. Projected Hessian updating algorithms for nonlinearly constrained optimization. SIAM J. Numerical Analysis. 22:821–850, 1985.MathSciNetCrossRefGoogle Scholar
  11. [11]
    M.J.D. Powell and Ph.L. Toint. On the estimation of sparse Hessian matrices. SIAM J. Numerical Analysis. 16:1060–1074, 1979.MathSciNetCrossRefGoogle Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • R. Fletcher
    • 1
  1. 1.Department of MathematicsUniversity of DundeeDundee ScotlandUK

Personalised recommendations