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

DOI10.1134/S1995080220080181MaRDI QIDQ2206971zbMATH OpenOpenAlexFDO

Authors I. M. Sokolinskaya, L. B. Sokolinsky

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

approximate solutioncluster computing systemfeasibility problemiterative methodparallel algorithmsystem of linear inequalities

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)

Abstract: In this paper, a scalable iterative projection-type algorithm for solving non-stationary systems of linear inequalities is considered. A non-stationary system is understood as a large-scale system of inequalities in which coefficients and constant terms can change during the calculation process. The proposed parallel algorithm uses the concept of pseudo-projection which generalizes the notion of orthogonal projection. The parallel pseudo-projection algorithm is implemented using the parallel BSF-skeleton. An analytical estimation of the algorithm scalability boundary is obtained on the base of the BSF cost metric. The large-scale computational experiments were performed on a cluster computing system. The obtained results confirm the efficiency of the proposed approach.

Recommendations

• A simultaneous projections method for linear inequalities
• New iterative methods for linear inequalities
• scientific article; zbMATH DE number 2080150
• scientific article; zbMATH DE number 1159803
• scientific article; zbMATH DE number 16987

Cites work

• Analytical estimation of the scalability of iterative numerical algorithms on distributed memory multiprocessors
• BSF-skeleton
• scientific article; zbMATH DE number 2111135 (Why is no real title available?)
• scientific article; zbMATH DE number 3029984 (Why is no real title available?)
• New methods for linear inequalities
• On Diagonally Relaxed Orthogonal Projection Methods
• Operators and iterative processes of Fejér type. Theory and applications.
• The Linear Complementarity Problem
• The master-slave paradigm in parallel computer and industrial settings
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

Cited in

(2)

• scientific article; zbMATH DE number 1830948 (Why is no real title available?)
• Generalized subsampled Newton method for large-scale linear inequalities with Tikhonov regularization

Describes a project that uses

Uses Software

• BSF-skeleton
• GitHub

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

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