Open AccessBook
Linear complementarity, linear and nonlinear programming
About:
The article was published on 1988-01-01 and is currently open access. It has received 1012 citations till now. The article focuses on the topics: Mixed complementarity problem & Complementarity theory.read more
Citations
More filters
Journal ArticleDOI
On the asymmetric eigenvalue complementarity problem
TL;DR: The eigenvalue complementarity problem (EiCP) where at least one of its defining matrices is asymmetric is discussed, and the EiCP is shown to be equivalent to finding a global minimum of an appropriate merit function on a convex set Ω defined by linear constraints.
Journal ArticleDOI
A test for copositive matrices
TL;DR: In this article, necessary and sufficient conditions that a symmetric matrix be copositive or strictly coposive are given in terms of the eigenvalues and eigenvectors of the principal submatrices of the given matrix.
Posted Content
Sliced Gromov-Wasserstein
TL;DR: A novel OT discrepancy is defined that can deal with large scale distributions via a slicing approach and is demonstrated to have ability to tackle similar problems as GW while being several order of magnitudes faster to compute.
Journal ArticleDOI
On finite termination of an iterative method for linear complementarity problems
Andreas Fischer,Christian Kanzow +1 more
TL;DR: A Newton-type method will be described for the solution of LCPs and it will be shown that this method has a finite termination property, i.e., if an iterate is sufficiently close to a solution ofLCP, the method finds this solution in one step.
Proceedings ArticleDOI
Linear optimization on modern GPUs
TL;DR: This paper shows how a revised simplex algorithm for solving linear programming problems originally described by Dantzig is used for both the CPU and GPU implementations, and shows that it can scale to problem sizes up to at least 2000 variables.