Instances of the cost approximation algorithm

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


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) .


Variational Inequality Regularization Method Maximal Monotone Variational Inequality Problem Merit Function 
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.


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