On the step choice in projection algorithms for large-scale linear programming problems

MaRDI QIDQ5408923zbMATH OpenFDO

Authors A. Velichko

Publication date 11 April 2014

zbMATH Keywords

constrained optimizationlarge-scale problemlinear programmingnumerical methodprojection algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Methods of reduced gradient type (90C52)

Recommendations

• On a class of iterative projection and contraction methods for linear programming
• On combined phase 1-phase 2 projective methods for linear programming
• scientific article; zbMATH DE number 3852786
• Projection algorithms for linear programming
• scientific article; zbMATH DE number 495923

Cited in

(4)

• A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems
• Steplength selection in gradient projection methods for box-constrained quadratic programs
• An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
• Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function

This page was built for publication: On the step choice in projection algorithms for large-scale linear programming problems

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