Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / 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: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robustness and scalability of semidefinite relaxation for optimal power flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition in Conic Optimization with Partially Separable Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualize it: software for automatic primal and dual conversions of conic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioned variable metric updates for large structured optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal decomposition in operator-splitting methods for sparse semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES-Accelerated ADMM for Quadratic Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multifrontal Method for Sparse Matrix Solution: Theory and Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Semidefinite Programming With Application to Large-Scale System Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity and nondegeneracy in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPLIB 1.2, a library of semidefinite programming test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Role of Elimination Trees in Sparse Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Evolution of the Minimum Degree Ordering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Nested Dissection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new graph parameter related to bounded rank positive semidefinite matrix completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing a primal-dual interior-point method for conic quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Product-form Cholesky factorization in interior point methods for second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms and applications for tree-like Weighted Set Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic barriers for sparse matrix cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: An independent benchmarking of SDP and SOCP solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite matrices with a given sparsity pattern / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming. Foundations and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric primal-dual path-following algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nesterov--Todd Direction in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results / rank
 
Normal rank

Revision as of 02:43, 26 July 2024

scientific article
Language Label Description Also known as
English
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
scientific article

    Statements

    Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (English)
    0 references
    0 references
    0 references
    2 July 2021
    0 references
    principal submatrix, clique tree conversion, interior-point method
    0 references
    0 references
    0 references
    0 references
    0 references
    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