An interior point potential reduction algorithm for the linear complementarity problem (Q1196718): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: The Jacobian matrix and global univalence of mappings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial affine algorithms for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01586054 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062228304 / rank | |||
Normal rank | |||
Latest revision as of 08:53, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An interior point potential reduction algorithm for the linear complementarity problem |
scientific article |
Statements
An interior point potential reduction algorithm for the linear complementarity problem (English)
0 references
16 January 1993
0 references
interior point potential reduction algorithm
0 references
linear complementarity
0 references
potential function
0 references
smallest eigenvalue
0 references
\(P\)-matrix
0 references
convex quadratic minimization
0 references
