Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem

DOI10.1137/0612047zbMath0742.65048OpenAlexW2003570424MaRDI QIDQ3980606

Jong-Shi Pang

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

zbMATH Keywords

interior-point methodConvergencelinear complementarity problemsmatrix splittingsufficient matricesiterative descent algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (6)

A globally convergent primal-dual interior point algorithm for convex programming ⋮ Multiple-objective approximation of feasible but unsolvable linear complementarity problems ⋮ On semimonotone star matrices and linear complementarity problem ⋮ Sign reversing and matrix classes ⋮ Unnamed Item ⋮ The basic theorem of complementarity revisited

This page was built for publication: Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem