Abstract
In this chapter we review the classical algorithms of optimization which are used in the numerical solution of shape design problems. For unconstrained minimization problems, the most widely used algorithm is the conjugate gradient method; however, it is best to begin with the method of steepest descent and Newton’s method.
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
© 1984 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Pironneau, O. (1984). Optimization Methods. In: Optimal Shape Design for Elliptic Systems. Springer Series in Computational Physics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87722-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-87722-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-87724-7
Online ISBN: 978-3-642-87722-3
eBook Packages: Springer Book Archive