Keywords
- Search Direction
- Line Search
- Feasible Point
- Convex Case
- Polyhedral Approximation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1985 Springer-Verlag
About this chapter
Cite this chapter
Kiwiel, K.C. (1985). Methods of feasible directions for nonconvex constrained problems. In: Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics, vol 1133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0074506
Download citation
DOI: https://doi.org/10.1007/BFb0074506
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15642-0
Online ISBN: 978-3-540-39509-6
eBook Packages: Springer Book Archive
