Strongly polynomial algorithm for a class of combinatorial LCPs (Q1088911): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(87)90036-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076336245 / rank | |||
Normal rank | |||
Revision as of 01:41, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly polynomial algorithm for a class of combinatorial LCPs |
scientific article |
Statements
Strongly polynomial algorithm for a class of combinatorial LCPs (English)
0 references
1987
0 references
We show that an LCP with positive definite coefficient matrix can be solved in time polynomially bounded by the size of the numbers in the coefficient matrix. As a special case, we have a strongly polynomial algorithm for the problem of fitting the best convex curve to a given set of points in \(R^ 2\).
0 references
linear complementary problem
0 references
convex curve fitting
0 references
strongly polynomial algorithm
0 references
fitting the best convex curve
0 references
