Skip to main content

Methods of feasible directions for nonconvex constrained problems

  • Chapter
  • First Online:
Book cover Methods of Descent for Nondifferentiable Optimization

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1133))

  • 689 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics