Complementarity and Fixed Point Problems Editors M. L. BalinskiR. W. Cottle Book 193 Citations 7 Readers 2k Downloads Part of the Mathematical Programming Studies book series (MATHPROGRAMM, volume 7)
Chapters Table of contents (12 chapters) About About this book Table of contents Search within book Front Matter PDF Computing stationary points B. Curtis Eaves Pages 1-14 Some pivot schemes for the linear complementarity problem C. E. Lemke Pages 15-35 An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds R. W. H. Sargent Pages 36-54 Robust implementation of Lemke's method for the linear complementarity problem J. A. Tomlin Pages 55-60 Computational complexity of complementary pivot methods Katta G. Murty Pages 61-73 Characterization of linear complementarity problems as linear programs O. L. Mangasarian Pages 74-87 On solving linear complementarity problems as linear programs Richard W. Cottle, Jong-Shi Pang Pages 88-107 Existence of solution rays for linear complementarity problems with Z-matrices S. R. Mohan Pages 108-119 A linear complementarity problem with an n by 2n “P”-matrix Ikuyo Kaneko Pages 120-141 On the parametric nonlinear complementarity problem Nimrod Megiddo Pages 142-150 Improving the convergence of fixed-point algorithms Michael J. Todd Pages 151-169 On the homotopic approach to systems of equations with separable mappings Masakazu Kojima Pages 170-184 About this book Keywords algorithms character complexity computation computational complexity convergence equation implementation mapping matrices Matrix online proving Bibliographic information DOI https://doi.org/10.1007/BFb0120777 Copyright Information Springer Berlin Heidelberg 1978 Publisher Name Springer, Berlin, Heidelberg eBook Packages Springer Book Archive Print ISBN 978-3-642-00787-3 Online ISBN 978-3-642-00788-0 Series Print ISSN 0303-3929 Series Online ISSN 1436-4646 Buy this book on publisher's site