Abstract
In this chapter we shall investigate the global optimization problem, specialized as
In (2.6.1), D ⊂ ℝ n is a robust, bounded and convex subset of the real n-space, and the Lipschitzian objective function f: D →ℝ 1 is (possibly) multiextremal on the set D. Observe that this problem is significantly more general than the case of interval or simplex feasible regions studied in previous chapters of Part 2: consequently, it is not obvious how a PAS type strategy could be directly realized for solving (2.6.1).
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
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Pintér, J.D. (1996). Partition Methods on General Convex and Star Sets. 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_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2502-5_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4751-2
Online ISBN: 978-1-4757-2502-5
eBook Packages: Springer Book Archive