A Linear Complementarity Problem with a P-Matrix ∗
暂无分享,去创建一个
[1] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .
[2] Sergey P. Shary,et al. On optimal solution of interval linear equations , 1995 .
[3] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .
[4] J. Pang. On the convergence of a basic iterative method for the implicit complementarity problem , 1982 .
[5] G. Alefeld,et al. Introduction to Interval Computation , 1983 .
[6] J. Rohn. Systems of linear interval equations , 1989 .
[7] Siegfried M. Rump,et al. INTLAB - INTerval LABoratory , 1998, SCAN.
[8] M. Fiedler,et al. On matrices with non-positive off-diagonal elements and positive principal minors , 1962 .
[9] Michael C. Ferris,et al. Engineering and Economic Applications of Complementarity Problems , 1997, SIAM Rev..
[10] Florian A. Potra,et al. A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity , 1997, SIAM J. Optim..
[11] J. Pang. Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem , 1984 .
[12] Jana Konickova,et al. On the Hull of the Solution Sets of Interval Linear Equations , 2001 .
[13] Walter D. Morris. Randomized pivot algorithms for P-matrix linear complementarity problems , 2002, Math. Program..
[14] Ulrich W. Kulisch,et al. Numerical Toolbox for Verified Computing I , 1993 .
[15] Robert J. Plemmons,et al. Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.
[16] Uwe Schäfer. AN ENCLOSURE METHOD FOR FREE BOUNDARY PROBLEMS BASED ON A LINEAR COMPLEMENTARITY PROBLEM WITH INTERVAL DATA , 2001 .
[17] Nimrod Megiddo,et al. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.
[18] Zhong-Zhi Bai,et al. On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem , 1999, SIAM J. Matrix Anal. Appl..
[19] Katta G. Murty,et al. Linear complementarity, linear and nonlinear programming , 1988 .
[20] C. Cryer. The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation , 1971 .
[21] H. Samelson,et al. A partition theorem for Euclidean $n$-space , 1958 .
[22] C. Cryer,et al. An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems , 1985 .
[23] J. Gillis,et al. Matrix Iterative Analysis , 1961 .
[24] J. Burke,et al. Complexity of a Noninterior Path-Following Method for the Linear Complementarity Problem , 2002 .
[25] Helmut Beeck,et al. Über Struktur und Abschätzungen der Lösungsmenge von linearen Gleichungssystemen mit Intervallkoeffizienten , 1972, Computing.
[26] Xiaojun Chen,et al. Numerical validation of solutions of linear complementarity problems , 1999, Numerische Mathematik.
[27] G. Stavroulakis. Multibody Dynamics with Unilateral Contacts by Friedrich Pfeiffer and Christoph Glocker, Wiley, New York, 1996 , 1998 .
[28] Alan S. Manne,et al. Equilibrium and Linear Complementarity - An Economy with Institutional Constraints on Prices , 1977 .
[29] A. Neumaier. Interval methods for systems of equations , 1990 .
[30] J T J van Eijndhoven,et al. Solving the linear complementarity problem in circuit simulation , 1986 .
[31] K. G. Murty. Computational complexity of complementary pivot methods , 1978 .
[32] K. G. Murty,et al. Complementarity problems , 2000 .
[33] Richard W. Cottle,et al. Linear Complementarity Problem. , 1992 .
[34] Richard W. Cottle,et al. On the solution of large, structured linear complementarity problems: The tridiagonal case , 1976 .
[35] Ulrich W. Kulisch,et al. PASCAL-XSC , 1992, Springer Berlin Heidelberg.