A Perturbation Based Method for Variational Inequality over Convex Polyhedral

  • Published : 1995.08.01

Abstract

This paper provides a locally convergent algorithm and a globally convergent algorithm for a variational inequality problem over convex polyhedral. The algorithm are based on the B (ouligand)-differentiability of the solution of a nonsmooth equation derived from the variational in-equality problem. Convergences of the algorithms are achieved by the results of Pang[3].

Keywords

References

  1. Mathematics of Operations Research v.17 Globally Convergent Newton Methods for Nonsmooth equations Han,S.-P.;Pang,J.-S.;Rangaraj,N.
  2. Journal of Optimization Theory and Applications v.57 Perturbed Solution of Variational Inequality Problems over Polyhedral Sets Kyparisis,J.
  3. Newton's Method for B-differentiable Equations, manuscript Pang,J.S.
  4. Solution Differentiability and Continuation of Newton's Method for Variational Inequality Problems over Polyhodral Sets, manuscript Pang,J.-S.
  5. Mathematical Programming v.51 A B-differentiable Equation-based, globally and locally quadratic Convergent Algorithm for Nonlinear Programs. Complementarity and Variational Inequality Problems Pang,J.S.
  6. Continuation Methods for Nonlinear Programming,Ph.D.Dissertation Park,K
  7. Mathematics of Operation Research v.14 Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets Qui,Y.;Magnanti,T.L.
  8. Technical Summary Report no.2854 Implicit B-differentiability in generalized equations Robinson,S.M.
  9. Newton's Method for a Class of Nonsmooth Functions, manuscript Robinson,S.M.
  10. Mathematical Programming v.48 Mathematical Foundations of Nonsmooth Embedding Methods Robinson,S.M.
  11. Mathematics fo Operation Research v.16 An Implicit-function the rem for a Class of Nonsmooth Functions Robinson,S.M.
  12. Convex Analysis Rockafellar,R.T.