A self-adjusting interior point algorithm for linear complementarity problems
type: Item
instance of: scholarly article
title: A self-adjusting interior point algorithm for linear complementarity problems
zbMATH Open document ID: 1127.90071
author: Suyan He
author: Shaohua Pan
author: Xingsi Li
publication date: 2006-02-02T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5003116
zbMATH Keywords: linear complementarity problems
zbMATH Keywords: central path
zbMATH Keywords: proximity measure
zbMATH Keywords: interior point algorithm
zbMATH Keywords: self-adjusting
describes a project that uses: LIPSOL
MaRDI profile type: Publication
full work available at URL: j.camwa.2005.03.002
OpenAlex ID: W2024895799
cites work: Complementarity problems
cites work: Q4003375
cites work: Q5691079
cites work: A new and efficient large-update interior-point method for linear optimization
cites work: Superlinear primal-dual affine scaling algorithms for LCP
cites work: Constant potential primal-dual algorithms: A framework
cites work: A self-adjusting primal–dual interior point method for linear programs
cites work: User'S guide To Lipsol linear-programming interior point solvers V0.4
cites work: The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
cites work: Solving the Nonlinear Complementarity Problem by a Homotopy Method
DOI: 10.1016/J.CAMWA.2005.03.002
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5003116