A method for solving the system of linear equations and linear inequalities
For the solution of a system consisting of linear equations and linear inequalities, a method called the ABS-MPVT algorithm is presented. The basic idea of the proposed method is based on the solution of the system of linear equations first via the Abaffy-Broyden-Spedicato (ABS) algorithms, and afterwards to the solution of an unconstrained minimization obtained by substituting the ABS general form of solutions into the system of linear inequalities. The unconstrained minimization problem can be solved by a (modified) parallel algorithm. The general algorithm and the ABS-MPVT algorithm and the convergence analysis and its conditions are detailed described.
- scientific article; zbMATH DE number 2204510
- scientific article; zbMATH DE number 5038517
- An two phase ABS method for solving over-determined systems of linear inequalities
- Explicit ABS solution of a class of linear inequality systems and LP problems
- A new method for solving systems of linear equalities and inequalities.
- A class of direct methods for linear systems
- ABS algorithms for linear equations and optimization
- Explicit ABS solution of a class of linear inequality systems and LP problems
- scientific article; zbMATH DE number 45283 (Why is no real title available?)
- scientific article; zbMATH DE number 46216 (Why is no real title available?)
- scientific article; zbMATH DE number 4128316 (Why is no real title available?)
- scientific article; zbMATH DE number 1873048 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- New inexact parallel variable distribution algorithms
- Parallel Gradient Distribution in Unconstrained Optimization
- Parallel Variable Distribution
- Parallel Variable Transformation in Unconstrained Optimization
- A new method for solving systems of linear equalities and inequalities.
- Regarding a method of improving the conditionality of a system of linear equations
- Solving fully fuzzy linear systems using implicit Gauss-Cholesky algorithm
- Methods for the elimination of unknowns from systems of linear inequalities and their applications
- scientific article; zbMATH DE number 3970037 (Why is no real title available?)
- scientific article; zbMATH DE number 1112745 (Why is no real title available?)
- scientific article; zbMATH DE number 1131736 (Why is no real title available?)
- An ABS representation theorem for polyhedral sets and its applications
- A locally polynomial method for solving a system of linear inequalities
- Solving a set of linear inequalities by the method of least squares
- scientific article; zbMATH DE number 269852 (Why is no real title available?)
- An ABS method for solving linear inequalities system
- Prescribed-time robust ZNN models for solving equality and inequality systems
- Novel varying-parameter ZNN schemes for solving TVLEIE under prescribed time with UR5 manipulator control application
- Solving fully fuzzy linear systems by using implicit Gauss-Cholesky algorithm
- Separable quadratic stochastic operators
- Parameters online identification-based data-driven backstepping control of hypersonic vehicles
- Two random algorithms for systems of linear inequalities and equations
This page was built for publication: A method for solving the system of linear equations and linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467154)
