A pivotal method for affine variational inequalities

Mathematics of Operations Research

Volumn 21, Issue 1, 1996, Pages 44-64

  Cao, Menglin ^b   Ferris, Michael C ^a  

^a University of Wisconsin Madison   (United States)

^b NONE

Author keywords

Affine variational inequality; Normal map; Path following algorithm

Indexed keywords

GEOMETRY; LINEAR PROGRAMMING; LINEARIZATION; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY; VARIATIONAL TECHNIQUES;

AFFINE VARIATIONAL INEQUALITY; LEMKES METHOD; LINEAR COMPLIMENTARITY PROBLEM; LINEAR TRANSFORMATION; NORMAL MAP; PATH FOLLOWING ALGORITHM; PIVOTAL METHOD; VARIATIONAL INEQUALITIES;

ALGORITHMS;

EID: 0030087162     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.21.1.44     Document Type: Article

References (21)

1. Burke, J. V. and J. J. Moré (1994). Exposing constraints. SIAM J. Optimization 4 573-595.
2. Cottle, R. W., J. S. Pang and R. E. Stone (1992). The Linear Complementarity Problem. Academic Press, New York.
3. Dai, Y. and D. Talman (1993). Linear stationary point problems on unbounded polyhedra. Math. Oper. Res. 18 635-644.
4. _, G. van der Laan, A. J. J. Talman and Y. Yamamoto (1991). A simplicial algorithm for the nonlinear stationary problem on an unbounded polyhedron. SIAM J. Optimization 1 151-165.
5. Eaves, B. C. (1971). On the basic theorem of complementarity. Math. Programming 1 68-87.
6. _ (1976). A short course in solving equations with pl homotopies. In R. W. Cottle and C. E. Lemke, Eds., Nonlinear Programming, pages 73-143, Providence, RI, 1976. American Mathematical Society, SIAM-AMS Proceedings.
7. _ (1978a). Computing stationary points. Mathematical Programming Study 7 1-14.
8. _ (1978b). Computing stationary points, again. In O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds., Nonlinear Programming 3, pages 391-405. Academic Press, New York.
9. Gill, P. E., W. Murray and M. H. Wright (1981). Practical Optimization. Academic Press, London.
10. Golub, G. H. and C. F. Van Loan (1983). Matrix Computations. The John Hopkins University Press, Baltimore, MD.
11. Karamardian, S. (1976). Complementarity problems over cones with monotone and pseudomonotone maps. J. of Optimization Theory and Applications 18 445-454.
12. Lemke, C. E. (1965). Bimatrix equilibrium points and mathematical programming. Management Sci. 11 681-689.
13. The Math Works (1992). MATLAB User's Guide. The Math Works, Inc. Natick, MA.
14. Murty, K. G. (1976). Linear and Combinatorial Programming. John Wiley & Sons, NY.
15. _ (1988). Linear Complementarity, Linear and Nonlinear Programming. Helderman-Verlag, Berlin.
16. Ralph, D. (1992). On branching numbers of normal manifolds. Technical Report 92-1283, Computer Science Department, Cornell University, Ithaca, NY.
17. Robinson, S. M. (1992). Normal maps induced by linear transformations. Math. Oper. Res. 17 691-714.
18. _ (1993). Nonsingularity and symmetry for linear normal maps. Math. Prog. 62 415-425.
19. Rockafellar, R. T. (1970). Convex Analysis. Princeton University Press, Princeton, NJ.
20. Talman, A. J. J. and Y. Yamamoto (1989). A simplicial algorithm for stationary point problems. Math. Oper. Res. 14 383-399.
21. Yamamoto, Y. (1987). A path-following algorithm for stationary point problems. J. Operations Society of Japan 30 181-198.