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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 513295
Language Label Description Also known as
default for all languages
No label defined
    English
    A deep cut ellipsoid algorithm for convex programming: Theory and applications
    scientific article; zbMATH DE number 513295

      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