Abstract
An augmented Lagrangian nonlinear programming algorithm has been developed. Its goals are to achieve robust global convergence and fast local convergence. Several unique strategies help the algorithm achieve these dual goals. The algorithm consists of three nested loops. The outer loop estimates the Kuhn-Tucker multipliers at a rapid linear rate of convergence. The middle loop minimizes the augmented Lagrangian functions for fixed multipliers. This loop uses the sequential quadratic programming technique with a box trust region stepsize restriction. The inner loop solves a single quadratic program. Slack variables and a constrained form of the fixed-multiplier middleloop problem work together with curved line searches in the inner-loop problem to allow large penalty wieghts for rapid outer-loop convergence. The inner-loop quadratic programs include quadratic onstraint terms, which complicate the inner loop, but speed the middle-loop progress when the constraint curvature is large.
The new algorithm compares favorably with a commercial sequential quadratic programming algorithm on five low-order test problems. Its convergence is more robust, and its speed is not much slower.
Similar content being viewed by others
References
Hestenes, M. R.,Multiplier and Gradient Methods, Journal of Optimization Theory and Applications, Vol. 4, pp. 303–320, 1969.
Powell, M. J. D.,A method for Nonlinear Constraints in Minimization Problems, Optimization, Edited by R. Fletcher, Academic Press, London, England, pp. 283–298, 1969.
Fletcher, R.,Practical Methods of Optimization, 2nd Edition, J. Wiley and Sons, New York, New York, 1987.
Psiaki, M. L., andPark, K.,A Parallel Trajectory Optimization Tool for Aerospace Plane Guidance, AIAA Paper No. 91-5069, AIAA 3rd International Aerospace Plane Guidance, AIAA Paper No. 91-5069, AIAA 3rd International Aerospace planes Conference, Orlando, Florida, 1991.
Gill, P. E., Murray, W., Saunders, M. A., andWright, M. H.,Use's Guide for NPSOL (Version 4.0): A FORTRAN Package for Nonlinear Programming, Report No., SOL 86-2, Systems Optimization Laboratory, Stanford Univerity, 1986.
Psiaki, M. L., andPark, K.,Detailed Description of an Augmented Lagrangian Nonlinear Programming Algorithm That Uses SQP and Trust Regionc Techiques, Report No. MSD-92-02, Mechanical and Aerospace Engineering, Cornell University, 1992.
Coleman, T. F., andConn, A. R.,Nonlinear Programming via an exact Penalty Function: Asymptotic Analysis, Mathematical Programming, Vol. 24, pp., 123–136, 1982.
Fletcher, R.,Second-Order Corrections for Nondifferntiable Opetimization, Numerical Analysis, Dundee 1981; Lecture Notes in Mathematics, Springer Verlag, New York, New York, Vol. 912, pp. 85–114, 1982.
Bettes, J. T., andHuffman, W. P.,Application of Sparse Nonlinear Programming to Trajectory Optimization, Journal of Gudance, Control, and Dynamics, Vol. 15, pp. 198–206, 1992.
Psiaki, M. L. andPark, K.,Parallel Orthogonal Factorization Null-Space Methods for Dynamic Quadratic Rogramming, Journal of Optimization Theory and Applications, Vol. 85, pp. 409–434, 1995.
Bette, J. T., andHuffman, W. P.,Trajectory Optimization on a Parallel Processor. Journal of Gudance, Control, and Dynamics, Vol. 14, pp. 431–439, 1991.
Author information
Authors and Affiliations
Additional information
Communicated by R. A. Tapia
This research was supported in part by the National Aeronautics and Space Administration under Grant No. NAG-1-1009.
Rights and permissions
About this article
Cite this article
Psiaki, M.L., Park, K. Augmented lagrangian nonlinear programming algorithm that uses SQP and trust region techniques. J Optim Theory Appl 86, 311–325 (1995). https://doi.org/10.1007/BF02192082
Issue Date:
DOI: https://doi.org/10.1007/BF02192082