A proximal point algorithm for log-determinant optimization with group Lasso regularization
The authors propose a proximal point algorithm for the solution of covariance selections problems, where it is assumed that the inverse covariance matrix has a block sparsity structure. In each iteration of the optimization algorithm the dual subproblem is used to update the primal variable. This approach is combined with an inexact Newton method to accelerate the optimization process. Global and local convergence results for the proposed method are proved. Furthermore, comprehensive numerical results are presented and discussed.
- Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- A proximal point dual Newton algorithm for solving group graphical Lasso problems
- Alternating direction method for covariance selection models
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- A dual spectral projected gradient method for log-determinant semidefinite problems
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
- On how to solve large-scale log-determinant optimization problems
- Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
- Enhancing pure-pixel identification performance via preconditioning
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
- An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems
- A proximal point dual Newton algorithm for solving group graphical Lasso problems
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Inexact proximal Newton methods for self-concordant functions
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
- Learning graph Laplacian with MCP
- 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
- A dual adaptive algorithm for matrix optimization with sparse group Lasso regularization
- A nonmonotone active-set semismooth Newton method for matrix approximation with group regularization
- Recovery bounds for cardinality regularized optimization problem
- An adaptive nonmonotone line search technique for nonsmooth optimization
- A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems
This page was built for publication: A proximal point algorithm for log-determinant optimization with group Lasso regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848177)
