A new algorithm for minimizing convex functions over convex sets (Q1918926): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5842044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5800951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes and column generation techniques with the projective algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Potential Reduction Algorithm Allowing Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204004 / rank
 
Normal rank

Latest revision as of 12:34, 24 May 2024

scientific article
Language Label Description Also known as
English
A new algorithm for minimizing convex functions over convex sets
scientific article

    Statements

    A new algorithm for minimizing convex functions over convex sets (English)
    0 references
    0 references
    9 December 1996
    0 references
    oracle
    0 references
    convex optimization
    0 references
    volumetric center of a polytope
    0 references
    ellipsoid of maximum volume
    0 references
    global convergence rate
    0 references

    Identifiers