Bard-type Methods for the Linear Complementarity problem with symmetric positive Definite Matrices

DOI10.1093/imaman/2.1.51zbMath0674.90091OpenAlexW1975684456MaRDI QIDQ3829364

F. M. Pires, Joaquim Joao Júdice

Publication date: 1989

Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imaman/2.1.51

zbMATH Keywords

linear complementaritysparse matricesconvex quadratic programmingP-matricesheuristic block Bard-type methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Optimal non-negative forecast reconciliation, On a ``stability in the linear complementarity problem, A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems