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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Joaquim A. S. Gromicho / rank
Normal rank
 
Property / author
 
Property / author: Shu-Zhong Zhang / rank
Normal rank
 
Property / author
 
Property / author: Joaquim A. S. Gromicho / rank
 
Normal rank
Property / author
 
Property / author: Shu-Zhong Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Server Location on a Network Operating as an <i>M</i>/<i>G</i>/1 Queue / 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: Workloads and waiting times in single-server systems with multiple customer classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremum problems in the presence of restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using deep cuts in an ellipsoid algorithm for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ellipsoid algorithm for nonlinear programming / 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: Q4296824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General models in min-max continuous location: Theory and solution techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exercises in integration. Transl. from the French by J. M. Cole / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Rates of the Ellipsoid Method on General Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable metric relaxation methods, part II: The ellipsoid method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3970132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Variational Inequalities by the Ellipsoid Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rate of the gradient descent method with dilatation of the space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Family of algorithms for solving convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3215459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Block Norms for Location Modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Karmarkar's algorithm and the ellipsoid method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097094 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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