On the non-polynomiality of the relaxation method for systems of linear inequalities (Q3929533): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Relaxation Method for Linear Inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Relaxation Method for Solving Systems of Linear Inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Relaxation Method for Linear Inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Over and Under Relaxation in the Theory of the Cyclic Single Step Iteration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient search for rationals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence rate of the gradient descent method with dilatation of the space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4097094 / rank | |||
Normal rank |
Latest revision as of 13:22, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the non-polynomiality of the relaxation method for systems of linear inequalities |
scientific article |
Statements
On the non-polynomiality of the relaxation method for systems of linear inequalities (English)
0 references
1982
0 references
non-polynomiality
0 references
relaxation method for inequalities
0 references
polynomial algorithm
0 references
Khachiyan's algorithm
0 references
ellipsoid method
0 references