Abstract
This chapter introduces regularity properties of GVIP(F, u, X) under which a CA algorithm will finitely identify the optimal active constraints at a point in SOL(F, u, X), and, given stronger properties, finitely identify a point in SOL(F, u, X). The results obtained generalize and improve upon several previous ones for instances of the class of CA algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
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). Finite identification of active constraints and of solutions. In: Nonlinear Programming and Variational Inequality Problems. Applied Optimization, vol 23. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2991-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2991-7_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4806-9
Online ISBN: 978-1-4757-2991-7
eBook Packages: Springer Book Archive