Abstract
In a very general setting, unconstrained optimization deals with the problem of minimizing a function f : F → ℝ over an open set F ⊆ ℝn:
.
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
© 2002 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Faigle, U., Kern, W., Still, G. (2002). Unconstrained Optimization. In: Algorithmic Principles of Mathematical Programming. Kluwer Texts in the Mathematical Sciences, vol 24. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9896-5_11
Download citation
DOI: https://doi.org/10.1007/978-94-015-9896-5_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6117-1
Online ISBN: 978-94-015-9896-5
eBook Packages: Springer Book Archive