New crash procedures for large systems of linear constraints (Q584077): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Automatic Scaling of Matrices for Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practicable steepest-edge simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution of Linear Programming Computing Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for profile and wavefront reduction of sparse matrices / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01589115 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051603784 / rank
 
Normal rank

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
New crash procedures for large systems of linear constraints
scientific article

    Statements

    New crash procedures for large systems of linear constraints (English)
    0 references
    0 references
    0 references
    1989
    0 references
    Many algorithms for solving linearly constrained optimization problems maintain sets of basic variables. The calculation of the initial basis is of great importance as it determines to a large extent the amount of computation that will then be required to solve the problem. This paper presents a number of simple methods for obtaining an initial basis and tests to indicate how they perform on a variety of real-life problems.
    0 references
    linearly constrained optimization
    0 references
    initial basis
    0 references
    0 references
    0 references

    Identifiers

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