Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem
From MaRDI portal
Publication:3980606
DOI10.1137/0612047zbMath0742.65048MaRDI QIDQ3980606
Publication date: 26 June 1992
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0612047
interior-point method; Convergence; linear complementarity problems; matrix splitting; sufficient matrices; iterative descent algorithms
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
A globally convergent primal-dual interior point algorithm for convex programming, The basic theorem of complementarity revisited, Multiple-objective approximation of feasible but unsolvable linear complementarity problems, Sign reversing and matrix classes