Scalable parallel algorithm for solving non-stationary systems of linear inequalities

DOI10.1134/S1995080220080181zbMath1450.65055arXiv2003.09956OpenAlexW3102363584MaRDI QIDQ2206971

I. M. Sokolinskaya, L. B. Sokolinskii

Publication date: 27 October 2020

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.09956

zbMATH Keywords

iterative methodapproximate solutionparallel algorithmsystem of linear inequalitiesfeasibility problemcluster computing system

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Uses Software

• GitHub
• BSF-skeleton

Cites Work

• Unnamed Item
• Unnamed Item
• BSF-skeleton
• New methods for linear inequalities
• Analytical estimation of the scalability of iterative numerical algorithms on distributed memory multiprocessors
• Operators and iterative processes of Fejér type. Theory and applications.
• The master-slave paradigm in parallel computer and industrial settings
• The Linear Complementarity Problem
• On Diagonally Relaxed Orthogonal Projection Methods
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: Scalable parallel algorithm for solving non-stationary systems of linear inequalities