Abstract
In this chapter we consider algorithms for the solution of general VIs. The methods considered here can be viewed as the natural extension of those presented in the previous chapters and are therefore applicable to non-monotone problems.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Algorithms for VIs. 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_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-21815-1_4
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