Abstract
In this chapter we will develop optimality conditions for nonlinear convex programs. These conditions are of the saddle type where no differentiability assumptions are required. We also develop stationary point optimality conditions in the absence of differentiability, where subgradients of the convex functions play the role of the gradients.
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
© 1976 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Bazaraa, M.S., Shetty, C.M. (1976). Convex Programming without Differentiability. In: Foundations of Optimization. Lecture Notes in Economics and Mathematical Systems, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48294-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-48294-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07680-3
Online ISBN: 978-3-642-48294-6
eBook Packages: Springer Book Archive