On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (Q1890928): 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/bf01585769 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995535418 / rank | |||
Normal rank | |||
Latest revision as of 10:20, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms |
scientific article |
Statements
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (English)
0 references
28 May 1995
0 references
predictor-corrector primal-dual interior-point algorithm
0 references
theoretical convergence
0 references
polynomial complexity bounds
0 references
0 references
0 references
