Abstract
Complementary to Chapter 11, the present chapter is devoted to the study of solution methods for VIs that are of the monotone type and also for NCPs of the P0 type. We already saw in Chapters 9 and 10 that the presence of some kind of monotonicity in a problem often leads to improved results for general algorithms capable of dealing with non-monotone problems. The methods studied in this chapter are distinctively different from those in previous chapters and strongly dependent on some kind of monotonicity of the problem; in fact, the methods presented herein usually cannot even be considered for problems lacking this particular property.
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.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
(2003). Methods for Monotone Problems. In: Facchinei, F., Pang, JS. (eds) Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research and Financial Engineering. Springer, New York, NY. https://doi.org/10.1007/978-0-387-21815-1_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-21815-1_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95581-0
Online ISBN: 978-0-387-21815-1
eBook Packages: Springer Book Archive