The cone method for solving linear systems

DOI10.1515/RNAM-2015-0001MaRDI QIDQ2257396zbMATH OpenOpenAlexFDO

Authors Valentin A. Bereznev

Publication date 25 February 2015

Published in Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/rnam-2015-0001

zbMATH Keywords

convex polyhedral conelinear inequalitieslinear programmingnonnegative solutionsharpened conesystem of linear equations

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• Conjugate directions method for solving interval linear systems
• A direct method for solving linear systems
• The focal point method for solving systems of linear equations
• scientific article; zbMATH DE number 56825
• Conjugate gradient solution of linear equations
• A line projection method for solving linear systems of equations
• scientific article; zbMATH DE number 4074370
• A constrained conjugate gradient method and the solution of linear equations
• Conical projection algorithms for linear programming
• scientific article; zbMATH DE number 4135708

Cited in

(1)

• Least distance methods for the frame of homogeneous equation systems

This page was built for publication: The cone method for solving linear systems

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