Abstract
A library of algorithms, for solving unconstrained nonlinear programming problems
has been presented in the mathematical programming literatures. There are many excellent books dealing with the algorithms comprehensively (to mention a few, Avriel [17], Bazaraa and Shetty [27], Fletcher [105], Gill, Murray and Wright [123], and Luenberger [205]). In this section we only introduce some basic algorithms which have already been frequently used or would be used in the future in artificial neural network study. The same consideration will be taken when we arrange the materials for the other chapters.
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
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Zhang, XS. (2000). Algorithms for Unconstrained Nonlinear Programming. In: Neural Networks in Optimization. Nonconvex Optimization and Its Applications, vol 46. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3167-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3167-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4836-6
Online ISBN: 978-1-4757-3167-5
eBook Packages: Springer Book Archive