Abstract
Consider the constrained global minimization problem
where the objective function φ, henceforth denoted g m +1, i.e., g m +1(x) = φ(x), and left-hand sides g i , 1 ≤ i ≤ m, of the constraints are assumed to be Lipschitzian respectively with constants L i , 1 ≤ i ≤ m + 1, and, in general, are multi-extremal.
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). Global Optimization under Non-Convex Constraints — The Index Approach. 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_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4677-1_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7117-5
Online ISBN: 978-1-4615-4677-1
eBook Packages: Springer Book Archive