Row-Oriented Decomposition in Large-Scale Linear Optimization

DOI10.1007/978-3-030-91059-4_4MaRDI QIDQ6488344zbMATH OpenFDO

Authors E. A. Nurminski, Natalia B. Shamray

Publication date 13 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-91059-4_4

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• Recent advances in the decomposition approach to linear programming
• scientific article; zbMATH DE number 432997
• scientific article; zbMATH DE number 1349588
• Decomposition method application to a large scale linear programming WIP projection model
• scientific article; zbMATH DE number 4027166

Cites work

• Accelerating the convergence of the method of alternating projections
• Alternating projection methods.
• Finding the nearest point in A polytope
• Functional Operators (AM-21), Volume 1
• scientific article; zbMATH DE number 999656 (Why is no real title available?)
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Single-projection procedure for linear optimization
• The method of projections for finding the common point of convex sets

Cited in

(4)

• A class of optimized row projection methods for solving large nonsymmetric linear systems
• Row-reduced column generation for degenerate master problems
• Vector Space Decomposition for Solving Large-Scale Linear Programs
• scientific article; zbMATH DE number 7656030 (Why is no real title available?)

This page was built for publication: Row-Oriented Decomposition in Large-Scale Linear Optimization

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