Abstract
The discrete global search algorithm derived in Sections 2.1–2.3 aims to produce the same solution for the problem (2.1.1) as the one juxtaposed to this problem by the uniform grid technique, but with lesser computational effort than in the item-by-item examination inherent to the grid technique. In fact, as already mentioned in Remark 2.6 at the end of Section 2.3, it may be purposeful to select substantially greater number n+1 of nodes for the grid (2.1.2) than is needed to ensure the required accuracy. Moreover, the requirements for the desired accuracy may happen to increase in the search process, and it may be quite reasonable to substantially increase the number of nodes in advance, aiming to cut the necessity for readjustment of the grid which otherwise may arise in the course of minimization. To completely resolve this problem, we develop the ‘limit algorithm’ for the problem (2.1.1) by transforming the above discrete algorithm with n → ∞. These transformations are convenient to carry out in the following way.
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
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Strongin, R.G., Sergeyev, Y.D. (2000). Core Global Search Algorithm and Convergence Study. In: Global Optimization with Non-Convex Constraints. Nonconvex Optimization and Its Applications, vol 45. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4677-1_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4677-1_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7117-5
Online ISBN: 978-1-4615-4677-1
eBook Packages: Springer Book Archive