A QMR-based interior-point algorithm for solving linear programs (Q1361110): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of preconditioned iterative methods for linear systems of algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving symmetric indefinite systems in an interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4328442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4309409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QMR-based interior-point algorithm for solving linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the QMR Method Based on Coupled Two-Term Recurrences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioners for Indefinite Systems Arising in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational results of an interior point algorithm for large scale linear programming / 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: Q3491304 / 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: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Sparse Indefinite Systems of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric indefinite systems for interior point methods / rank
 
Normal rank

Latest revision as of 16:37, 27 May 2024

scientific article
Language Label Description Also known as
English
A QMR-based interior-point algorithm for solving linear programs
scientific article

    Statements

    A QMR-based interior-point algorithm for solving linear programs (English)
    0 references
    0 references
    0 references
    23 July 1997
    0 references
    symmetric indefinite linear system
    0 references
    quasi-minimal residual iteration
    0 references
    implementation of interior-point methods
    0 references
    indefinite preconditioners
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers