Scholarlink

Abstract <p>A new algorithm for solving a system of linear inequalities using the accelerated Fejér process of searching for a non-negative solution to a system of linear algebraic equations is presented. The Part 1 of this paper presents the theoretical justification of the algorithm and the results of a preliminary (illustrative) computational experiment on a system of medium-dimensional inequalities with real industrial data. The experimental results demonstrate the operability of the proposed algorithm and its higher convergence rate (estimated by the spent time and the number of performed iterations) compared to the three main variants of the “classical” Fejér algorithms for solving systems of linear inequalities based on the strategies of <i>weighted</i>, <i>sequential</i>, and <i>extreme</i> combining of Fejér projection mappings onto half-spaces corresponding to the individual inequalities of the inequality system under study. A more detailed experimental study of the proposed algorithm will be performed in Part 2 of the paper.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A New Algorithm for Solving a System of Linear Inequalities Based on the Accelerated Fejér Process for Funding a Non-Negative Solution to a System of Linear Algebraic Equations. Part 1

  • 期刊论文

  • 发表日期：

    2026年4月19日

查看全文
  • V. I. Erokhin,
  • G. Sh. Tamasyan

摘要

Abstract

A new algorithm for solving a system of linear inequalities using the accelerated Fejér process of searching for a non-negative solution to a system of linear algebraic equations is presented. The Part 1 of this paper presents the theoretical justification of the algorithm and the results of a preliminary (illustrative) computational experiment on a system of medium-dimensional inequalities with real industrial data. The experimental results demonstrate the operability of the proposed algorithm and its higher convergence rate (estimated by the spent time and the number of performed iterations) compared to the three main variants of the “classical” Fejér algorithms for solving systems of linear inequalities based on the strategies of weighted, sequential, and extreme combining of Fejér projection mappings onto half-spaces corresponding to the individual inequalities of the inequality system under study. A more detailed experimental study of the proposed algorithm will be performed in Part 2 of the paper.