Abstract
We demonstrate the scope and diversity of the CA algorithm for GVIP (F, u, X) by examining a number of the methods included in the framework. The descriptions mainly concentrate on the cost approximating step (Step 1 in Table 1.1) .
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Patriksson, M. (1999). Instances of the cost approximation algorithm. In: Nonlinear Programming and Variational Inequality Problems. Applied Optimization, vol 23. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2991-7_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2991-7_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4806-9
Online ISBN: 978-1-4757-2991-7
eBook Packages: Springer Book Archive