On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (Q1890928): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references