On hidden \(Z\)-matrix and interior point algorithm
type: Item
instance of: scholarly article
title: On hidden \(Z\)-matrix and interior point algorithm
zbMATH Open document ID: 1475.90112
author: Yanyan Li
published in: Opsearch
publication date: 2019-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 7137243
zbMATH Keywords: \(Z\)-matrix
zbMATH Keywords: hidden \(Z\)-matrix
zbMATH Keywords: simplex method
zbMATH Keywords: interior point algorithm
zbMATH Keywords: linear complementarity problem
MaRDI profile type: Publication
full work available at URL: s12597-019-00412-0
OpenAlex ID: W2974571870
cites work: Finiteness of Criss-Cross Method in Complementarity Problem
cites work: Linear complementarity problems solvable by A single linear program
cites work: Polyhedral sets having a least element
cites work: Q4003375
cites work: An interior point potential reduction algorithm for the linear complementarity problem
Wikidata QID: Q127251694
DOI: 10.1007/S12597-019-00412-0
description: scientific article; zbMATH DE number 7137243