Abstract
This paper describes an interior-point algorithm for solving large scale nonlinear programming problems. The fundamental step of the algorithm requires solution of a sparse symmetric indefinite linear system. Rowand column scaling are used to ensure that the system is well-conditioned. A globalization strategy based on a nonlinear filter is used instead of a merit function. The computational performance of the algorithm is demonstrated on a high index partial differential- algebraic equation application.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Ashcraft, R. G. Grimes, and J. G. Lewis, Accurate Symmetric Indefinite Linear Equation Solvers, SIAM Journal of Matrix Analysis, 20 (1999), pp. 513–561.
J. T. Betts, Practical Methods for Optimal Control using Nonlinear Programming, Society for Industrial and Applied Mathematics, Philadelphia, PA., 2001.
J. T. Betts, S. K. Eldersveld, P. D. Frank, and J. G. Lewis, An Interior-Point Nonlinear Programming Algorithm for Very Large Scale Optimization, Mathematics and Computing Technology Report M&CT-TECH-003, Mathematics and Computing Technology, The Boeing Company, PO Box 3707, Seattle, WA 98124-2207, Apr. 2000.
J. T. Betts and P. D. Frank, A Sparse Nonlinear Optimization Algorithm, Journal of Optimization Theory and Applications, 82 (1994), pp. 519–541.
R. H. Byrd, M. E. Hribar, and J. Nocedal, An Interior Point Algorithm for Large Scale Nonlinear Programming, SIAM Journal on Optimization, 9 (2000), pp. 877–900.
A. V. Fiacco and G. P. Mccormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons,, New York, New York, 1968.
R. Fletcher and S. Leyffer, Nonlinear Programming Without a Penalty Function, University of Dundee Numerical Analysis Report NA/171, University of Dundee, Department of Mathematics, Dundee, DD1 4HN, Scotland, U.K., 1997.
D. M. Gay, M. L. Overton, and M. H. Wright, A Primal-Dual Interior Method for Nonconvex Nonlinear Programming, in Advances in Nonlinear Programming, Y. Yuan, ed., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998, pp. 31–56.
R. J. Vanderbei and D. F. Shanno, An Interior-Point Method for Nonconvex Nonlinear Programming, Computational Optimization and Applications, 13 (1999), pp. 231–252.
S. J. Wright, Primal-Dual Interior-Point Methods, Society for Industrial and Applied Mathematics, Philadelphia, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Betts, J.T., Eldersveld, S.K., Frank, P.D., Lewis, J.G. (2003). An Interior-Point Algorithm for Large Scale Optimization. In: Biegler, L.T., Heinkenschloss, M., Ghattas, O., van Bloemen Waanders, B. (eds) Large-Scale PDE-Constrained Optimization. Lecture Notes in Computational Science and Engineering, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55508-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-55508-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-05045-2
Online ISBN: 978-3-642-55508-4
eBook Packages: Springer Book Archive