Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming (Q1338138): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / 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: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank

Revision as of 10:34, 23 May 2024

scientific article
Language Label Description Also known as
English
Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
scientific article

    Statements

    Identifiers