A continuation algorithm for a class of linear complementarity problems using an extrapolation technique
type: Item
instance of: scholarly article
title: A continuation algorithm for a class of linear complementarity problems using an extrapolation technique
zbMATH Open document ID: 0782.65076
DOI: 10.1016/0024-3795(93)90291-U
author: J. Ding
published in: Linear Algebra and its Applications
publication date: 1993-07-21T00:00:00Z
review text: This paper presents a polynomial-time continuation method for linear complementarity problems with positive semidefinite matrices. Linear extrapolation is combined with a Newton process. Computational results are not supplied.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 205210
zbMATH Keywords: quadratic programming
zbMATH Keywords: polynomial-time continuation method
zbMATH Keywords: linear complementarity
zbMATH Keywords: positive semidefinite matrices
zbMATH Keywords: Linear extrapolation
zbMATH Keywords: Newton process
reviewed by: Thomas F. Coleman
MaRDI profile type: Publication
cites work: Q3327633
cites work: A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems
cites work: Q5749159
cites work: Q5588268
cites work: Generation of degenerate linear programming problems
cites work: A new polynomial-time algorithm for linear programming
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: Q4039868
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Unified complexity analysis for Newton LP methods
Wikidata QID: Q127719755
description: scientific article; zbMATH DE number 205210