Logarithmic barriers for sparse matrix cones
From MaRDI portal
Abstract: Algorithms are presented for evaluating gradients and Hessians of logarithmic barrier functions for two types of convex cones: the cone of positive semidefinite matrices with a given sparsity pattern, and its dual cone, the cone of sparse matrices with the same pattern that have a positive semidefinite completion. Efficient large-scale algorithms for evaluating these barriers and their derivatives are important in interior-point methods for nonsymmetric conic formulations of sparse semidefinite programs. The algorithms are based on the multifrontal method for sparse Cholesky factorization.
Recommendations
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Barrier Functions in Interior Point Methods
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
Cites work
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- A set of level 3 basic linear algebra subprograms
- An extended set of FORTRAN basic linear algebra subprograms
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- Constructing memory-minimizing schedules for multifrontal methods
- Covariance matrix selection and estimation via penalised normal likelihood
- Covariance selection for nonchordal graphs via chordal embedding
- Direct Methods for Sparse Linear Systems
- Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
- Evaluating Derivatives
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- First-Order Methods for Sparse Covariance Selection
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- On Finding Supernodes for Sparse Matrix Computations
- On the storage requirement in the out-of-core multifrontal method for sparse factorization
- Positive definite completions of partial Hermitian matrices
- Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
- Sparse inverse covariance estimation with the graphical lasso
- Sparse quasi-Newton updates with positive definite matrix completion
- The influence of relaxed supernode partitions on the multifrontal method
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The Role of Elimination Trees in Sparse Factorization
Cited in
(11)- Some properties of the Hessian of the logarithmic barrier function
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Bregman primal-dual first-order method and application to sparse semidefinite programming
- GMRES-accelerated ADMM for quadratic objectives
- Inexact proximal Newton methods for self-concordant functions
- Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
- A smoothing method for sparse optimization over polyhedral sets
- Linear optimization over homogeneous matrix cones
- Performance enhancements for a generic conic interior point algorithm
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- Computing conjugate barrier information for nonsymmetric cones
This page was built for publication: Logarithmic barriers for sparse matrix cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299902)
