A dual spectral projected gradient method for log-determinant semidefinite problems (Q1986103): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q126319000, #quickstatements; #temporary_batch_1718023025760
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming / 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: A New Active Set Algorithm for Box Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382293 / 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: An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive First-Order Methods for General Sparse Inverse Covariance Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone spectral projected gradient method for large-scale topology optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On how to solve large-scale log-determinant optimization problems / 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: A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction method for covariance selection models / rank
 
Normal rank

Revision as of 07:50, 22 July 2024

scientific article
Language Label Description Also known as
English
A dual spectral projected gradient method for log-determinant semidefinite problems
scientific article

    Statements

    A dual spectral projected gradient method for log-determinant semidefinite problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 April 2020
    0 references
    dual spectral projected gradient methods
    0 references
    log-determinant semidefinite programs with linear constraints
    0 references
    dual problem
    0 references
    theoretical convergence results
    0 references
    computational efficiency
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references