Summary
In this paper we describe several modifications to reduce the memory requirement of the total quasi-Newton method proposed by Andreas Griewank et al.
The idea is based on application of the compact representation formulae for the wellknown BFGS and SR1 update for unconstrained optimization. It is shown how these definitions can be extended to a total quasi-Newton approach for the constrained case.
A brief introduction to the limited-memory approach is described in the present paper using an updated null-space factorization for the KKT system as well as an efficient numerical implementation of the null-space method in which the null-space representation is not stored directly. It can be proven that the number of operations per iteration is bounded by a bilinear order \(\mathcal{O}(n \cdot max(m,l))\) instead of a cubic order \(\mathcal{O}(m \cdot {n^2})\) for standard SQP methods. Here ndenotes the number of variables, m the maximal number of active constraints, and lthe user-selected number of stored update vectors.
† Supported by the DFG Research Center MATHEON “Mathematics for Key technologies” , Straße des 17. Juni 136, 10623 Berlin, Germany, www.matheon.de
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Bosse T (2009) A Derivative-matrix-free NLP Solver without Explicit Nullspace Representation. Diploma Thesis, Humboldt Universität zu Berlin, Berlin
Byrd R, et al. (1994) Representations of quasi-Newton matrices and their use in limited-memory methods, Math. Programming 63:129–156
Griewank A, Walther A (2008) Evaluating derivatives. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA
Griewank A, Walther A, Korzec M (2007) Maintaining factorized KKT systems subject to rank-one updates of Hessians and Jacobians, Optimization Methods & Software 22:279–295
Korzec M (2006) A General-Low-Rank Update-Based Quadratic Programming Solver. Diploma Thesis, Humboldt Universität zu Berlin, Berlin
Nocedal J, Wright S (2006) Numerical Optimization, Springer Series in Operations Research, 2nd Edt.
Schloßhauer V (2009) Strukturausnutzung und Speicherplatzbegrenzung für hochdimensionale, nichtlineare Optimierung. Diploma Thesis, Humboldt Universität zu Berlin, Berlin
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer -Verlag Berlin Heidelberg
About this paper
Cite this paper
Bosse, T., Griewank, A., Lehmann, L., Schloßhauer, V. (2010). On Hessian- and Jacobian-Free SQP Methods - a Total Quasi-Newton Scheme with Compact Storage. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds) Recent Advances in Optimization and its Applications in Engineering. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12598-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-12598-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12597-3
Online ISBN: 978-3-642-12598-0
eBook Packages: EngineeringEngineering (R0)