Hyper-sparsity in the revised simplex method and how to exploit it
From MaRDI portal
Publication:2490370
Recommendations
- Sparsity in higher order methods for unconstrained optimization
- Methods for sparse and low-rank recovery under simplex constraints
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- On solutions of sparsity constrained optimization
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Sparsity based methods for overparameterized variational problems
- The complexity results of the sparse optimization problems and reverse convex optimization problems
- On the use of dense matrix techniques within sparse simplex
Cites work
- A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem
- A stabilization of the simplex method
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- Matrix augmentation and partitioning in the updating of the basis inverse
- MIP: Theory and practice -- closing the gap
- Pivot selection methods of the Devex LP code
- Pivoting for Size and Sparsity in Linear Programming Inversion Routes
- Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
- Solving Real-World Linear Programs: A Decade and More of Progress
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Steepest-edge simplex algorithms for linear programming
- The Product Form for the Inverse in the Simplex Method
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Cited in
(19)- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- Parallel search paths for the simplex algorithm
- Parallelizing the dual revised simplex method
- Implementation of an interior point method with basis preconditioning
- A decomposition-based approach for the multiperiod multiproduct distribution planning problem
- Novel update techniques for the revised simplex method
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- Dual multilevel optimization
- scientific article; zbMATH DE number 3852786 (Why is no real title available?)
- Computing in operations research using Julia
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos
- Interior point methods 25 years later
- COAP 2013 Best Paper Prize
- Mixed integer programming: A historical perspective with Xpress-MP
- scientific article; zbMATH DE number 966292 (Why is no real title available?)
- Interior point methods in the year 2025
- Surface movement method for linear programming
- Towards a practical parallelisation of the simplex method
Describes a project that uses
Uses Software
This page was built for publication: Hyper-sparsity in the revised simplex method and how to exploit it
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490370)
