Affiliation:
1. Mathematics Department, Saskatchewan Polytechnic, Saskatoon, SK S7K 3R5, Canada
Abstract
In this study, we proposed proximal analytic center cutting plane algorithms for solving variational inequalities whose domains are normal regions. Our algorithms stop with a solution of the variational inequality after a finite number of iterations, or we may find a sequence that converges to the solution of the variational inequality. We introduced the definition of the Nash economic equilibrium solution over a normal region and proved a sufficient condition for our Nash economic solution. An example of Nash equilibrium over a normal region is also provided. Our proximal analytic center cutting plane algorithms are constructive proofs of our Nash equilibrium problems.
Reference24 articles.
1. The Cutting Plane Method for Solving Convex Programs;Kelley;J. SIAM,1960
2. Cutting Planes and Column Generation Techniques with the Projective Algorithm;Gon;J. Optim. Theory Appl.,1990
3. Merle, O.D. (1995). Interior Points and Cutting Palnes: A Development and Implementation of Methods for Convex Optimization and Large Scale Structured Linear Programming. [Ph.D. Thesis, Department of Management Studies, University of Geneva]. (In French).
4. Experimental Behaviour of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming;Bahn;Discret. Appl. Math.,1994
5. A Cutting Plane Method from Analytic Centers for Stochastic Programming;Bahn;Math. Program.,1995