Mathematical Programming Studies - Complementarity and Fixed Point Problems
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642007873, 9783642007880

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Computing stationary points

Mathematical Programming Studies - Complementarity and Fixed Point Problems ◽

10.1007/bfb0120778 ◽

1978 ◽

pp. 1-14 ◽

Cited By ~ 34

Author(s):

B. Curtis Eaves

Keyword(s):

Stationary Points

Download Full-text

Existence of solution rays for linear complementarity problems with Z-matrices

Mathematical Programming Studies - Complementarity and Fixed Point Problems ◽

10.1007/bfb0120785 ◽

1978 ◽

pp. 108-119 ◽

Cited By ~ 4

Author(s):

S. R. Mohan

Keyword(s):

Complementarity Problems ◽

Linear Complementarity Problems ◽

Linear Complementarity ◽

Existence Of Solution

Download Full-text

A linear complementarity problem with an n by 2n “P”-matrix

Mathematical Programming Studies - Complementarity and Fixed Point Problems ◽

10.1007/bfb0120786 ◽

1978 ◽

pp. 120-141 ◽

Cited By ~ 15

Author(s):

Ikuyo Kaneko

Keyword(s):

Linear Complementarity Problem ◽

Complementarity Problem ◽

Linear Complementarity ◽

P Matrix

Download Full-text

Robust implementation of Lemke's method for the linear complementarity problem

Mathematical Programming Studies - Complementarity and Fixed Point Problems ◽

10.1007/bfb0120781 ◽

1978 ◽

pp. 55-60 ◽

Cited By ~ 19

Author(s):

J. A. Tomlin

Keyword(s):

Linear Complementarity Problem ◽

Complementarity Problem ◽

Linear Complementarity ◽

Robust Implementation

Download Full-text

An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds

Mathematical Programming Studies - Complementarity and Fixed Point Problems ◽

10.1007/bfb0120780 ◽

1978 ◽

pp. 36-54 ◽

Cited By ~ 15

Author(s):

R. W. H. Sargent

Keyword(s):

Lower Bounds ◽

Efficient Implementation ◽

Upper And Lower Bounds

Download Full-text

Improving the convergence of fixed-point algorithms

Mathematical Programming Studies - Complementarity and Fixed Point Problems ◽

10.1007/bfb0120788 ◽

1978 ◽

pp. 151-169 ◽

Cited By ~ 34

Author(s):

Michael J. Todd

Keyword(s):

Fixed Point ◽

Fixed Point Algorithms

Download Full-text

Computational complexity of complementary pivot methods

Mathematical Programming Studies - Complementarity and Fixed Point Problems ◽

10.1007/bfb0120782 ◽

1978 ◽

pp. 61-73 ◽

Cited By ~ 41

Author(s):

Katta G. Murty

Keyword(s):

Computational Complexity ◽

Pivot Methods

Download Full-text

Characterization of linear complementarity problems as linear programs

Mathematical Programming Studies - Complementarity and Fixed Point Problems ◽

10.1007/bfb0120783 ◽

1978 ◽

pp. 74-87 ◽

Cited By ~ 52

Author(s):

O. L. Mangasarian

Keyword(s):

Complementarity Problems ◽

Linear Complementarity Problems ◽

Linear Complementarity ◽

Linear Programs

Download Full-text

On the parametric nonlinear complementarity problem

Mathematical Programming Studies - Complementarity and Fixed Point Problems ◽

10.1007/bfb0120787 ◽

1978 ◽

pp. 142-150 ◽

Cited By ~ 11

Author(s):

Nimrod Megiddo

Keyword(s):

Complementarity Problem ◽

Nonlinear Complementarity Problem ◽

Nonlinear Complementarity

Download Full-text

On the homotopic approach to systems of equations with separable mappings

Mathematical Programming Studies - Complementarity and Fixed Point Problems ◽

10.1007/bfb0120789 ◽

1978 ◽

pp. 170-184 ◽

Cited By ~ 17

Author(s):

Masakazu Kojima

Keyword(s):

Systems Of Equations

Download Full-text

Mathematical Programming Studies - Complementarity and Fixed Point ProblemsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Computing stationary points

Existence of solution rays for linear complementarity problems with Z-matrices

A linear complementarity problem with an n by 2n “P”-matrix

Robust implementation of Lemke's method for the linear complementarity problem

An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds

Improving the convergence of fixed-point algorithms

Computational complexity of complementary pivot methods

Characterization of linear complementarity problems as linear programs

On the parametric nonlinear complementarity problem

On the homotopic approach to systems of equations with separable mappings

Mathematical Programming Studies - Complementarity and Fixed Point Problems
Latest Publications