Abstract
Two new diagonal methods based on the efficient partition strategy are studied in this Chapter. Both of them use multiple estimates of the Lipschitz constant as done in the popular DIRECT method. The methods are thoroughly explained and illustrated in this final Chapter; their numerical comparison is reported; the application of an important practical signal processing problem is considered.
No matter how good you get, you can always get better and that’s the exciting part.
Tiger Woods
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 The Author(s)
About this chapter
Cite this chapter
Sergeyev, Y.D., Kvasov, D.E. (2017). Global Optimization Algorithms Based on the Non-redundant Partitions . In: Deterministic Global Optimization. SpringerBriefs in Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-7199-2_4
Download citation
DOI: https://doi.org/10.1007/978-1-4939-7199-2_4
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-7197-8
Online ISBN: 978-1-4939-7199-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)