Abstract
As we have seen in the previous chapters most of the existing methods in optimization focus on the very important problem of computing feasible points that satisfy necessary optimality conditions (Kuhn-Tucker points). In the previous chapter, we studied a special class of minimax problems for which a characterization of its global solutions was obtained.
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Du, DZ., Pardalos, P.M., Wu, W. (2001). From Local to Global. In: Du, DZ., Pardalos, P.M., Wu, W. (eds) Mathematical Theory of Optimization. Nonconvex Optimization and Its Applications, vol 56. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5795-8_15
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5795-8_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5202-8
Online ISBN: 978-1-4757-5795-8
eBook Packages: Springer Book Archive