Simplices by point-sliding and the Yamnitsky-Levin algorithm (Q1366323): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3342208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—The Ellipsoid Method: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deep cut ellipsoid algorithm for convex programming: Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Khachiyan’s algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifications and implementation of the ellipsoid algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941185 / rank
 
Normal rank

Latest revision as of 18:44, 27 May 2024

scientific article
Language Label Description Also known as
English
Simplices by point-sliding and the Yamnitsky-Levin algorithm
scientific article

    Statements

    Simplices by point-sliding and the Yamnitsky-Levin algorithm (English)
    0 references
    0 references
    0 references
    10 September 1997
    0 references
    0 references
    simplex
    0 references
    ellopsoid method
    0 references
    testing feasibility
    0 references
    systems of linear inequalities
    0 references