Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
From MaRDI portal
(Redirected from Publication:3083318)
Recommendations
- On how to solve large-scale log-determinant optimization problems
- A proximal point algorithm for log-determinant optimization with group Lasso regularization
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- A dual spectral projected gradient method for log-determinant semidefinite problems
- QUIC: quadratic approximation for sparse inverse covariance estimation
Cited in
(36)- A dual spectral projected gradient method for log-determinant semidefinite problems
- A dual adaptive algorithm for matrix optimization with sparse group Lasso regularization
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Discussion: Latent variable graphical model selection via convex optimization
- Rejoinder: Latent variable graphical model selection via convex optimization
- A nonmonotone active-set semismooth Newton method for matrix approximation with group regularization
- On how to solve large-scale log-determinant optimization problems
- Discussion: Latent variable graphical model selection via convex optimization
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- On the Solution of ℓ0-Constrained Sparse Inverse Covariance Estimation Problems
- Discussion: Latent variable graphical model selection via convex optimization
- Discussion: Latent variable graphical model selection via convex optimization
- Sparse precision matrix estimation with missing observations
- Alternating direction method for covariance selection models
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- Alternating proximal gradient method for convex minimization
- Model selection for factorial Gaussian graphical models with an application to dynamic regulatory networks
- Dual spectral projected gradient method for generalized log-det semidefinite programming
- A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
- Fused multiple graphical lasso
- Learning graph Laplacian with MCP
- An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem
- Graphical model selection for Gaussian conditional random fields in the presence of latent variables
- Discussion: Latent variable graphical model selection via convex optimization
- Discussion: Latent variable graphical model selection via convex optimization
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- A block coordinate gradient descent method for regularized convex separable optimization and covariance selection
- A proximal point dual Newton algorithm for solving group graphical Lasso problems
- Latent variable graphical model selection via convex optimization
- An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems
- Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm
- A proximal point algorithm for log-determinant optimization with group Lasso regularization
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Reconstruction of sparse-view tomography via preconditioned Radon sensing matrix
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
This page was built for publication: Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083318)
