On hidden \(Z\)-matrix and interior point algorithm

DOI10.1007/s12597-019-00412-0zbMath1475.90112OpenAlexW2974571870WikidataQ127251694 ScholiaQ127251694MaRDI QIDQ2009197

Yanyan Li

Publication date: 27 November 2019

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-019-00412-0

zbMATH Keywords

linear complementarity problemsimplex methodinterior point algorithm\(Z\)-matrixhidden \(Z\)-matrix

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (3)

A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps ⋮ Bounded homotopy path approach to the solution of linear complementarity problems ⋮ On column competent matrices and linear complementarity problem

Cites Work

• Unnamed Item
• An interior point potential reduction algorithm for the linear complementarity problem
• Linear complementarity problems solvable by A single linear program
• Finiteness of Criss-Cross Method in Complementarity Problem
• Polyhedral sets having a least element

This page was built for publication: On hidden \(Z\)-matrix and interior point algorithm