Alternating direction method for covariance selection models (Q2276406): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10915-011-9507-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093042090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3125701 / 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: Q4311908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of the alternating direction method of multipliers to separable convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new inexact alternating directions method for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable-penalty alternating directions method for convex optimization / 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: Smooth Optimization Approach for Sparse Covariance Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant Maximization with Linear Matrix Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent method for structured monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model selection and estimation in the Gaussian graphical model / rank
 
Normal rank

Latest revision as of 19:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Alternating direction method for covariance selection models
scientific article

    Statements

    Alternating direction method for covariance selection models (English)
    0 references
    5 November 2012
    0 references
    The covariance selection problem is used in different fields such as speech recognition, gene networks analysis, machine learning and so on. To perform the covariance selection problem, \textit{A. d'Aspremont}, \textit{O. Banerjee} and \textit{L. El Ghaoui} [SIAM J. Matrix Anal. App. 3, No 1, 56--66 (2008; Zbl 1156.90423)] proposed to maximize the log-likelihood model penalized by the \(l _{1}\)-norm. This paper shows that the well-known alternating direction method (ADM) can be applied to solve the mentioned problem. Some preliminary numerical results show that ADM is an efficient algorithm for large-scale cases of the \(l _{1}\)-norm penalized log-likelihood model which is not well researched in the literature yet.
    0 references
    covariance selection
    0 references
    log-likelihood
    0 references
    alternating direction method
    0 references
    numerical results
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers