Abstract
In this chapter, we describe the numerical methods which lie at the heart of the first release of LANCELOT. At this time, LANCELOT comprises two different optimization algorithms, one for solving the simple- bound constrained minimization problem and the other for the more general nonlinearly constrained problem. We shall give a description of the bound constrained technique, LANCELOT/SBMIN, and of the nonlinearly constrained method, LANCELOT/AUGLG. We shall refer to these two methods as SBMIN and AUGLG for short.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Conn, A.R., Gould, N.I.M., Toint, P.L. (1992). A Comprehensive Description of the Mathematical Algorithms Used in LANCELOT. In: Lancelot. Springer Series in Computational Mathematics, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12211-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-12211-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08139-2
Online ISBN: 978-3-662-12211-2
eBook Packages: Springer Book Archive