An extension of interior point potential reduction algorithm to solve general lcps (Q835795): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-008-9356-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995136572 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear Complementarity as a General Solution Method to Combinatorial Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On affine scaling algorithms for nonconvex quadratic programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4382667 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A class of linear complementarity problems solvable in polynomial time / rank | |||
Normal rank | |||
Latest revision as of 21:57, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extension of interior point potential reduction algorithm to solve general lcps |
scientific article |
Statements
An extension of interior point potential reduction algorithm to solve general lcps (English)
0 references
31 August 2009
0 references
interior point method
0 references
linear complementarity problem
0 references
condition number
0 references
algorithm
0 references
extension
0 references
