Abstract
Chapters II, VI; and to a lesser extent: Chap.V (dual norms), Chap. VII (minimality conditions and saddle points).
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
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hiriart-Urruty, JB., Lemaréchal, C. (1993). Descent Theory for Convex Minimization: The Case of Complete Information. In: Convex Analysis and Minimization Algorithms I. Grundlehren der mathematischen Wissenschaften, vol 305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02796-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-02796-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08161-3
Online ISBN: 978-3-662-02796-7
eBook Packages: Springer Book Archive