Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's (Q3657800): Difference between revisions

Latest revision as of 11:17, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's	scientific article

Statements

instance of

scholarly article

0 references

title

Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's (English)

0 references

0 references

0 references

Mathematical Programming

0 references

publication date

1983

0 references

zbMATH Keywords

computational complexity

0 references

linear complementarity problem

0 references

variable dimension algorithm

0 references

pivot step requirement

0 references

describes a project that uses

PLALGO

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5592809

0 references

Completely- matrices

0 references

Complementary pivot theory of mathematical programming

0 references

Computational complexity of LCPs associated with positive definite symmetric matrices

0 references

Bimatrix Equilibrium Points and Mathematical Programming

0 references

Computational complexity of complementary pivot methods

0 references

On the computational complexity of piecewise-linear homotopy algorithms

0 references

A variable dimension algorithm for the linear complementarity problem

0 references

full work available at URL

https://doi.org/10.1007/bf02591869

0 references

Identifiers

zbMATH Open document ID

0512.90093

0 references

DOI

10.1007/BF02591869

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3657800

@@ Property / describes a project that uses @@
+PLALGO
@@ Property / describes a project that uses: PLALGO / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592809
@@ Property / cites work: Q5592809 / rank @@
+Normal rank
@@ Property / cites work @@
+Completely- matrices
@@ Property / cites work: Completely- matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Complementary pivot theory of mathematical programming
+Normal rank
@@ Property / cites work @@
+Computational complexity of LCPs associated with positive definite symmetric matrices
+Normal rank
@@ Property / cites work @@
+Bimatrix Equilibrium Points and Mathematical Programming
+Normal rank
@@ Property / cites work @@
+Computational complexity of complementary pivot methods
+Normal rank
@@ Property / cites work @@
+On the computational complexity of piecewise-linear homotopy algorithms
+Normal rank
@@ Property / cites work @@
+A variable dimension algorithm for the linear complementarity problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02591869
+Normal rank
@@ Property / OpenAlex ID @@
+W2067610090
@@ Property / OpenAlex ID: W2067610090 / rank @@
+Normal rank