Finite identification of active constraints and of solutions

  • Michael Patriksson
Part of the Applied Optimization book series (APOP, volume 23)

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.

Keywords

Variational Inequality Problem Active Constraint Relative Interior Gradient Projection Method Sharp Minimum 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1999

Authors and Affiliations

  • Michael Patriksson
    • 1
  1. 1.Chalmers University of TechnologyGothenburgSweden

Personalised recommendations