Abstract
Let us consider a convex programming problem (CPP):
subject to constraints:
where F ν (x), ν ∈ {{0} ∪ I}, are proper convex fuctions determined on convex open neigborhood X 1 of a given convex set X. We introduce the notion of “information portion” for this problem.
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
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Shor, N.Z. (1998). Subgradient and ε-Subgradient Methods. In: Nondifferentiable Optimization and Polynomial Problems. Nonconvex Optimization and Its Applications, vol 24. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6015-6_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6015-6_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4792-5
Online ISBN: 978-1-4757-6015-6
eBook Packages: Springer Book Archive