Solving variational inequalities defined on a domain with infinitely many linear constraints

Computational Optimization and Applications

Volumn 37, Issue 1, 2007, Pages 67-81

  Fang, Shu Cherng ^a,b   Wu, Soonyi ^c,e   Birbil, Ş Ilker ^d  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b TSINGHUA UNIVERSITY   (China)

^c NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^d SABANCI UNIVERSITY   (Turkey)

^e NATIONAL CENTER FOR THEORETICAL SCIENCES   (Taiwan)

Author keywords

Analytic center based cutting plane method; Discretization method; Semi infinite programming; Variational inequality problem

Indexed keywords

CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING;

ANALYTIC CENTER BASED CUTTING PLANE METHOD; DISCRETIZATION METHOD; SEMI INFINITE PROGRAMMING; VARIATIONAL INEQUALITY PROBLEMS;

LINEAR PROGRAMMING;

EID: 34047174699     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9013-4     Document Type: Article

References (30)

1. Anderson, E.J., Nash, P.: Linear Programming in Infinite-Dimensional Spaces. Wiley, Chichester (1987)
2. Birbil, S.I., Fang, S.-C.: An electromagnetism-like mechanism for global optimization. J. Glob. Optim. 25, 263-282 (2003)
3. Cheney, E.W., Goldstein, A.A.: Newton's method for convex programming and Tchebycheff approximation. Numer. Math. 1, 253-268 (1959)
4. Eaves, B.C., Zangwill, W.I.: Generalized cutting plane algorithms. SIAM J. Control 9, 529-542 (1971)
5. Elzinga, J., Moore, T.G.: A central cutting plane algorithm for the convex programming problem. Math. Program. 8, 134-145 (1975)
6. Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003)
7. Fang, S.-C., Rajasekera, J.R., Tsao, H.-S.J.: Entropy Optimization and Mathematical Programming. Kluwer Academic, Boston (1997)
8. Fang, S.-C., Wu, S.-Y., Sun, J.: An analytic center cutting plane method for solving semi-infinite variational inequality problems. J. Glob. Optim. 28, 141-152 (2004)
9. Goberna, M.A., Lopez, M.A.: A comprehensive survey of linear semi-infinite optimization theory. In: Reemsten, R., Ruckmann, J.-J. (eds.) Semi-Infinite Programming, pp. 3-27. Kluwer Academic, Dordrecht (1998)
10. Goffin, J.-L., Luo, Z.-Q., Ye, Y.: On the complexity of a column generation algorithm for convex or quasiconvex feasibility problems. In: Hager, W.W., Hearn, D.W., Pardalos, P.M. (eds.) Large Scale Optimization: State of the Art. Kluwer, New York (1993)
11. Goffin, J.-L., Luo, Z., Ye, Y.: Complexity analysis of an interior cutting plane method for convex feasibility problems. SIAM J. Optim. 6, 638-652 (1996)
12. Goffin, J.-L., Marcotte, P., Zhu, D.: An analytic center cutting plane method for pseudomonotone variational inequalities. Oper. Res. Lett. 20, 1-6 (1997)
13. Goffin, J.-L., Vial, J.-P.: Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method, Logilab Technical report, Department of Management Studies, University of Geneva, Switzerland (1999)
14. Han, J., Huang, Z.-H., Fang, S.-C.: Solvability of variational inequality problems. J. Optim. Theory Appl. 122, 501-520 (2004)
15. Harker, P.T., Pang, J.-S.: Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications. Math. Program. 48, 161-220 (1990)
16. Horst, R.: Deterministic methods in constrained global optimization: some recent advances and new fields of application. J. SIAM 8, 703-712 (1960)
17. Kelley, J.E.: The cutting-plane method for solving convex programs. Numer. Math. 1, 253-268 (1959)
18. Luo, Z.-Q., Sun, J.: An analytic center based column generation algorithm for convex quadratic feasibility problems. SIAM J. Optim. 9, 217-235 (1999)
19. Luo, Z.-Q., Sun, J.: A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities. Comput. Optim. Appl. 15, 167-191 (2000)
20. Lüthi, H.-J., Bueler, B.: An analytical center quadratic cut method for strongly monotone variational inequality problems. SIAM J. Optim. 10, 415-426 (2000)
21. Magnanti, T.L., Perakis, G.: A unifying geometric solution framework and complexity analysis for variational inequalities. Math. Program. 71, 327-351 (1995)
22. Marcotte, P., Zhu, D.: A cutting plane method for solving quasimonotone variational inequalities. Comput. Optim. Appl. 20, 317-324 (2001)
23. Nesterov, Yu., Vial, J.-Ph.: Homogeneous analytic center cutting plane methods for convex problems and variational inequalities. SIAM J. Optim. 9, 708-728 (1999)
24. Reemtsen, R., Ruckmann, J.-J. (eds.): Semi-Infinite Programming. Kluwer Academic, Dordrecht (1998)
25. Reemtsen, R., Ruckmann, J.J.: Numerical methods for semi-infinite programming: a survey. In: Reemsten, R., Ruckmann, J.-J. (eds.) Semi-Infinite Programming, pp. 195-275. Kluwer Academic, Dordrecht (1998)
26. Tichatschke, R., Nobeling, V.: A cutting plane method for quadratic semi-infinite programming problems. Optimization 19, 803-817 (1988)
27. Veinott, A.F.: The supporting hyperplane method for unimodal programming. Oper. Res. 15, 147-152 (1967)
28. Wu, S.-Y., Fang, S.-C., Lin, C.-J.: Relaxed cutting plane method for solving linear semi-infinite programming problems. J. Optim. Theory Appl. 99, 759-779 (1998)
29. Zhao, Y.B., Han, J.: Exceptional family of elements for variational inequality problem and its applications. J. Glob. Optim. 14, 313-330 (1998).
30. Zhu, Y.J.: Generalization of some fundamental theorems on linear inequalities. Acta Math. Sinica 16, 25-40 (1966)