Logarithmic barriers for sparse matrix cones (Q5299902): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030828780 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1203.2742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multifrontal parallel distributed symmetric and unsymmetric solvers / 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 influence of relaxed supernode partitions on the multifrontal method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covariance selection for nonchordal graphs via chordal embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Methods for Sparse Covariance Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Methods for Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extended set of FORTRAN basic linear algebra subprograms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set of level 3 basic linear algebra subprograms / 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: An Optimal Positive Definite Update for Sparse Hessian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse inverse covariance estimation with the graphical lasso / 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: Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Derivatives / 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: Constructing memory-minimizing schedules for multifrontal methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covariance matrix selection and estimation via penalised normal likelihood / 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: An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the storage requirement in the out-of-core multifrontal method for sparse factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent Sparse Matrix Reordering by Elimination Tree Rotations / 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: The Multifrontal Method for Sparse Matrix Solution: Theory and Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Supernodes for Sparse Matrix Computations / 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: Sparse quasi-Newton updates with positive definite matrix completion / rank
 
Normal rank

Latest revision as of 13:15, 6 July 2024

scientific article; zbMATH DE number 6179984
Language Label Description Also known as
English
Logarithmic barriers for sparse matrix cones
scientific article; zbMATH DE number 6179984

    Statements

    Logarithmic barriers for sparse matrix cones (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    multifrontal method
    0 references
    sparse matrices
    0 references
    semidefinite programming
    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