New crash procedures for large systems of linear constraints

DOI10.1007/BF01589115MaRDI QIDQ584077zbMATH OpenOpenAlexFDO

Authors Nicholas I. M. Gould, J. K. Reid

Publication date 1989

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01589115

zbMATH Keywords

linearly constrained optimizationinitial basis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Recommendations

• Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
• scientific article; zbMATH DE number 3852786
• A practical anti-cycling procedure for linearly constrained optimization
• Linearly constrained optimization
• Dealing with degeneracy in reduced gradient algorithms

Cites work

• scientific article; zbMATH DE number 3833697 (Why is no real title available?)
• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
• A practicable steepest-edge simplex algorithm
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• An algorithm for profile and wavefront reduction of sparse matrices
• Evolution of linear programming computing techniques
• Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
• On the Automatic Scaling of Matrices for Gaussian Elimination

Cited in

(8)

• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• scientific article; zbMATH DE number 4095202 (Why is no real title available?)
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• Advances in design and implementation of optimization software
• A two-phase support method for solving linear programs: numerical experiments
• Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
• A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
• Crash start of interior point methods

Describes a project that uses

Uses Software

• HSL
• MINOS

This page was built for publication: New crash procedures for large systems of linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q584077)