Abstract
Among the non-linear optimization problems, those of convex optimization are the ones which still have a number of properties in common with the linear problems; and because of the Kuhn-Tucker Theorem, they are susceptible to a more thoroughgoing theoretical treatment.
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
© 1975 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Collatz, L., Wetterling, W. (1975). Convex Optimization. In: Optimization Problems. Applied Mathematical Sciences, vol 17. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6378-4_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6378-4_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-90143-5
Online ISBN: 978-1-4612-6378-4
eBook Packages: Springer Book Archive