A method for solving the system of linear equations and linear inequalities (Q2467154)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A method for solving the system of linear equations and linear inequalities |
scientific article; zbMATH DE number 5228553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A method for solving the system of linear equations and linear inequalities |
scientific article; zbMATH DE number 5228553 |
Statements
A method for solving the system of linear equations and linear inequalities (English)
0 references
18 January 2008
0 references
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.
0 references
system of linear equations
0 references
system of linear inequalities
0 references
parallel algorithm
0 references
convex programming
0 references
nonlinear programming
0 references
Abaffy-Broyden-Spedicato (ABS) algorithms
0 references
unconstrained minimization
0 references
convergence
0 references