RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 2009 Volume 49, Number 8, Pages 1385–1398 (Mi zvmmf4733)

This article is cited in 2 papers

On the numerical solution of the linear complementarity problem

E. O. Mazurkevicha, E. G. Petrovab, A. S. Strekalovskiib

a Institute of Problems of Information Science, Tatarstan Academy of Sciences, ul. Chekhova 36, Kazan, 420012, Russia
b Institute for System Dynamics and Control Theory, Siberian Branch, Russian Academy of Sciences, ul. Lermontova 134, Irkutsk, 664033, Russia

Abstract: The well-known linear complementarity problem with definite matrices is considered. It is proposed to solve it using a global optimization algorithm in which one of the basic stages is a special local search. The proposed global search algorithm is tested using a variety of randomly generated problems; a detailed analysis of the computational experiment is given.

Key words: linear complementarity problem, nonconvex problem, d.c. function, global and local search.

UDC: 519.658

Received: 19.01.2008
Revised: 26.05.2009


 English version:
Computational Mathematics and Mathematical Physics, 2009, 49:8, 1318–1331

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025