A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01582060 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083880788 / rank
 
Normal rank

Latest revision as of 10:18, 30 July 2024

scientific article
Language Label Description Also known as
English
A deep cut ellipsoid algorithm for convex programming: Theory and applications
scientific article

    Statements

    A deep cut ellipsoid algorithm for convex programming: Theory and applications (English)
    0 references
    0 references
    0 references
    0 references
    10 March 1994
    0 references
    deep cut
    0 references
    ellipsoid algorithm
    0 references
    continuous convex programming
    0 references
    rate of convergence
    0 references
    min-max stochastic queue location
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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