Abstract
In this chapter, we discuss global optimization problems where the functions in?volved are Lipschitz—continuous or have a related property on certain subsets M c ℝn. Section 1 presents a brief introduction into the most often treated univariate case. Section 2 is devoted to branch and bound methods. First it is shown that the well-known univariate approaches can be interpreted as branch and bound methods. Next, several extensions of univariate methods to the case of n dimensional problems with rectangular feasible sets are discussed. Then it is recalled from Chapter IV that very general Lipschitz optimization problems and also very general systems of equations and (or) inequalities can be solved by means of branch and bound techniques. As an example of Lipschitz optimization, the problem of minimizing a concave function subject to separable indefinite quadratic constraints is discussed in some detail. Finally, the concept of Lipschitz functions is extended to so-called functions with concave minorants.
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-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Horst, R., Tuy, H. (1996). Lipschitz and Continuous Optimization. In: Global Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03199-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-03199-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08247-4
Online ISBN: 978-3-662-03199-5
eBook Packages: Springer Book Archive