Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem

DOI10.1137/0612047MaRDI QIDQ3980606zbMATH OpenOpenAlexFDO

Authors 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

Convergenceinterior-point methoditerative descent algorithmslinear complementarity problemsmatrix splittingsufficient matrices

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)

Cited in

(7)

• 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
• Row-reduced column generation for degenerate master problems
• On the convergence of an iterative method for solving linear complementarity problem with WGPSBD matrix
• On semimonotone star matrices and linear complementarity problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3980606)