On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (Q1890928): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4003375 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank | |||
Normal rank | |||
Revision as of 13:37, 23 May 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
