Skip to main content

Convergence Properties of Adaptive Partition Algorithms

  • Chapter
Global Optimization in Action

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 6))

  • 332 Accesses

Abstract

Let us assume that the global optimization problem CGOP (2.1.1) or LGOp (2.1.9) is to be solved by an adaptive partition strategy which, in its basic structure, follows the partition algorithm scheme (PAS) described in Section 2.1.2.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Pintér, J.D. (1996). Convergence Properties of Adaptive Partition Algorithms. In: Global Optimization in Action. Nonconvex Optimization and Its Applications, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2502-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2502-5_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4751-2

  • Online ISBN: 978-1-4757-2502-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics