Results 81 to 90 of about 253 (124)

On the average speed of Lemke's algorithm for quadratic programming

Mathematical Programming, 1986
We show that the average number of steps of the Lemke algorithm for the quadratic programming problems grows at most linearly in the number of variables while fixing the number of constraints. The result and method were motivated by Smale's result on linear programming problems.
Yieh-Hei Wan
openalex   +3 more sources

Computing Economic Equilibria on Affine Networks with Lemke's Algorithm.

, 1977
Richard Asmuth, B. Curtis Eaves, Elmor L. Peterson   +2 more
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Copositive-plus Lemke algorithm solves polymatrix games

Operations Research Letters, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miller, Douglas A., Zucker, Steven W.
openaire   +1 more source

A modified Lemke Algorithm for dynamic rigid plastic response of skeletal structures

Computers & Structures, 2021
Abstract This paper proposes a modified Lemke algorithm to determine the non-holonomic response of rigid plastic skeletal structures subjected to extreme dynamic loading. The basic formulation for the dynamic rigid-plastic response has a mathematical form of linear complementarity problem (LCP), and, equivalently, a pair of dual quadratic programs ...
Azam Khan, Irshad Ahmad, Wajid Khan, Niaz Bahadur Khan, Muhammad Aslam   +4 more
openaire   +1 more source

Some LCPs solvable in strongly polynomial time with Lemke’s algorithm

Mathematical Programming, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adler, Ilan, Cottle, Richard W., Pang, Jong-Shi   +2 more
openaire   +1 more source

Even more with the Lemke complementarity algorithm

Mathematical Programming, 1986
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the Alass of Complementary Cones and Lemke’s Algorithm

SIAM Journal on Applied Mathematics, 1972
In this paper, a geometrical description of Lemke’s algorithm is presented for solving the linear complementarily problem: Find nonnegative vectors x and y satisfying $x = My + q$, $x^T y = 0$. This description is analogous to the simplicial description of the simplex method. A study is made of the class of all complementary cones and it is shown that,
openaire   +2 more sources

Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule

Journal of Optimization Theory and Applications, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A note on the Lemke-Howson algorithm

1974
The Lemke-Howson algorithm for bimatrix games provides both an elementary proof of the existence of equilibrium points and an efficient computational method for finding at least one equilibrium point. The first half of this paper presents a geometrical view of the algorithm that makes its operation especially easy to visualize.
openaire   +1 more source

On the Convergence of the Lemke–Howson Algorithm for Bi-Matrix Games

Journal of Mathematical Sciences, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources