Alternating direction method for covariance selection models
From MaRDI portal
Publication:2276406
DOI10.1007/s10915-011-9507-1zbMath1255.65031OpenAlexW2093042090MaRDI QIDQ2276406
Publication date: 5 November 2012
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-011-9507-1
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (35)
On how to solve large-scale log-determinant optimization problems ⋮ An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ An alternating direction method of multipliers for MCP-penalized regression with high-dimensional data ⋮ Sparse approximate solution of fitting surface to scattered points by MLASSO model ⋮ Alternating proximal gradient method for convex minimization ⋮ An alternating direction method for finding Dantzig selectors ⋮ A fast splitting method tailored for Dantzig selector ⋮ On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities ⋮ A proximal alternating linearization method for minimizing the sum of two convex functions ⋮ Sparse and low-rank matrix regularization for learning time-varying Markov networks ⋮ Sparse precision matrix estimation with missing observations ⋮ A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers ⋮ First-order methods for convex optimization ⋮ Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems ⋮ An ADM-based splitting method for separable convex programming ⋮ Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection ⋮ Alternating direction method of multipliers for sparse principal component analysis ⋮ Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization ⋮ A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints ⋮ Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing ⋮ Efficient algorithms for solving condition number-constrained matrix minimization problems ⋮ A distributed quantile estimation algorithm of heavy-tailed distribution with massive datasets ⋮ Individual-specific, sparse inverse covariance estimation in generalized estimating equations ⋮ A dual spectral projected gradient method for log-determinant semidefinite problems ⋮ An extragradient-based alternating direction method for convex minimization ⋮ Unnamed Item ⋮ An efficient method for solving a matrix least squares problem over a matrix inequality constraint ⋮ A distributed Douglas-Rachford splitting method for multi-block convex minimization problems ⋮ An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation ⋮ Sparse and low-rank covariance matrix estimation ⋮ An ADMM with continuation algorithm for non-convex SICA-penalized regression in high dimensions ⋮ Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization ⋮ Unnamed Item ⋮ Fused Multiple Graphical Lasso ⋮ An alternating direction method with continuation for nonconvex low rank minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Smooth minimization of non-smooth functions
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A variable-penalty alternating directions method for convex optimization
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- Multiplier and gradient methods
- Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
- Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Model selection and estimation in the Gaussian graphical model
- First-Order Methods for Sparse Covariance Selection
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Smooth Optimization Approach for Sparse Covariance Selection
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Determinant Maximization with Linear Matrix Inequality Constraints
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- A descent method for structured monotone variational inequalities
This page was built for publication: Alternating direction method for covariance selection models
