Merit functions for variational inequality problems

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


As was remarked upon in Section 1.2, the availability of a merit function for GVIP(F, u, X) which can be evaluated at any point of dom u ∩ X is instrumental for the development of algorithms with mild conditions for convergence; such a merit function can also be an aid in the algorithm itself, both in the selection of step lengths, and in monitoring the convergence of the algorithm through the error bounds that the merit function may supply. This chapter describes and analyzes a family of merit functions which can be constructed for GVIP(F, u, X) and which are evaluated automatically within a CA algorithm.


Complementarity Problem Sequential Quadratic Programming Variational Inequality Problem Merit Function Strong Monotonicity 
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