Skip to Main Content

Bulletin of the American Mathematical Society

The Bulletin publishes expository articles on contemporary mathematical research, written in a way that gives insight to mathematicians who may not be experts in the particular topic. The Bulletin also publishes reviews of selected books in mathematics and short articles in the Mathematical Perspectives section, both by invitation only.

ISSN 1088-9485 (online) ISSN 0273-0979 (print)

The 2020 MCQ for Bulletin of the American Mathematical Society is 0.84.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Book Review

The AMS does not provide abstracts of book reviews. You may download the entire review from the links below.


MathSciNet review: 1568002
Full text of review: PDF   This review is available free of charge.
Book Information:

Author: J.~S. Pang R.~W. Cottle, and R.~E. Stone
Title: The linear complementarity problem
Additional book information: Academic Press, New York, 1992, xxiv+762 pp., US$59.95. ISBN 0-12-192350-9.

References [Enhancements On Off] (What's this?)

  • Richard W. Cottle, Jong-Shi Pang, and Richard E. Stone, The linear complementarity problem, Computer Science and Scientific Computing, Academic Press, Inc., Boston, MA, 1992. MR 1150683
  • [2]
    S. Dirkse, M. Ferris, P. Preckel, and T. Rutherford, The GAMS callable program library for variational and complementarity solvers, manuscript, April 1992.
  • B. Curtis Eaves, The linear complementarity problem, Management Sci. 17 (1971), 612–634. MR 282663, DOI 10.1287/mnsc.17.9.612
  • B. C. Eaves, On the basic theorem of complementarity, Math. Programming 1 (1971), no. 1, 68–75. MR 287901, DOI 10.1007/BF01584073
  • M. Kojima, N. Megiddo, T. Noma, and A. Yoshise, A unified approach to interior point algorithms for linear complementarity problems, Lecture Notes in Computer Science, vol. 538, Springer-Verlag, Berlin, 1991. MR 1226025, DOI 10.1007/3-540-54509-3
  • C. E. Lemke, Bimatrix equilibrium points and mathematical programming, Management Sci. 11 (1964/65), 681–689. MR 189823, DOI 10.1287/mnsc.11.7.681
  • O. L. Mangasarian, Solution of symmetric linear complementarity problems by iterative methods, J. Optim. Theory Appl. 22 (1977), no. 4, 465–485. MR 458831, DOI 10.1007/BF01268170
  • K. G. Murty, Linear complementarity, linear and nonlinear programming, Sigma Series in Applied Mathematics, vol. 3, Heldermann Verlag, Berlin, 1988. MR 949214
  • J. S. Pang, On the convergence of a basic iterative method for the implicit complementarity problem, J. Optim. Theory Appl. 37 (1982), no. 2, 149–162. MR 663519, DOI 10.1007/BF00934765
  • Stephen M. Robinson, Generalized equations and their solutions. I. Basic theory, Math. Programming Stud. 10 (1979), 128–141. Point-to-set maps and mathematical programming. MR 527064, DOI 10.1007/bfb0120850
  • Patrick Du Val, The unloading problem for plane curves, Amer. J. Math. 62 (1940), 307–311. MR 1603, DOI 10.2307/2371454

  • Review Information:

    Reviewer: M. C. Ferris
    Journal: Bull. Amer. Math. Soc. 28 (1993), 169-175
    DOI: https://doi.org/10.1090/S0273-0979-1993-00344-6