A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (Q2709447): 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.1080/02331930008844515 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039096676 / rank | |||
Normal rank | |||
Revision as of 00:12, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> |
scientific article |
Statements
A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (English)
0 references
27 November 2001
0 references
interior point algorithms
0 references
nonlinear monotone complementarity problems
0 references
polynomial complexity
0 references
