Finite identification of active constraints and of solutions
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.
KeywordsVariational Inequality Problem Active Constraint Relative Interior Gradient Projection Method Sharp Minimum
Unable to display preview. Download preview PDF.