An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02206812 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983719058 / rank | |||
Normal rank | |||
Latest revision as of 09:59, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence |
scientific article |
Statements
An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (English)
0 references
24 October 1996
0 references
infeasible-interior-point algorithm
0 references
polynomiality
0 references
superlinear convergence
0 references
Mizuno-Todd-Ye predictor-corrector algorithm
0 references
monotone linear complementarity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
