A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for fixed-dimensional linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01582137 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985372427 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:59, 30 July 2024

scientific article
Language Label Description Also known as
English
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
scientific article

    Statements

    A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (English)
    0 references
    0 references
    0 references
    6 December 1993
    0 references
    fixed dimension optimization
    0 references
    Clarkson's randomized algorithm
    0 references
    interior point method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references