Abstract
In Chapter I, we introduce the main classes of global optimization problems that we study: concave minimization, reverse convex constraints, d.—c. programming, and Lipschitz optimization. Some basic properties of these problems and various applications are discussed. It is also shown that very general systems of equalities and (or) inequalities can be formulated as global optimization problems.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Horst, R., Tuy, H. (1990). Some Important Classes of Global Optimization Problems. In: Global Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02598-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-02598-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-02600-7
Online ISBN: 978-3-662-02598-7
eBook Packages: Springer Book Archive