Solving the linear complementarity problem through concave programming

DOI10.1016/S0041-5553(83)80101-3zbMath0552.90088OpenAlexW1985553727MaRDI QIDQ3346107

Nguyen Van Thoai, Hoang Tuy

Publication date: 1983

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0041-5553(83)80101-3

zbMATH Keywords

linear complementarity problemsolution algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (4)

Global minimization of indefinite quadratic problems ⋮ An experimental study of a DC optimization algorithm for bimatrix games ⋮ A new concave minimization algorithm for the absolute value equation solution ⋮ Note on solving linear complementarity problems as jointly constrained bilinear programs

This page was built for publication: Solving the linear complementarity problem through concave programming