On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1507.03549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characterizations and properties of the ``distance to the ill-posedness'' and the condition measure of a conic linear system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / 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: Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision / 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: Q4197641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Accuracy Semidefinite Programming Bounds for Kissing Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact duality theory for semidefinite programming and its complexity implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for packings of spheres of several radii / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latest Developments in the SDPA Family for Solving Large-Scale SDPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097094 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1639981145 / rank
 
Normal rank

Latest revision as of 09:38, 30 July 2024

scientific article
Language Label Description Also known as
English
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming
scientific article

    Statements

    On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (English)
    0 references
    0 references
    0 references
    0 references
    23 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    semidefinite programming
    0 references
    interior point method
    0 references
    Turing model complexity
    0 references
    ellipsoid method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references