A coordinate descent algorithm for sparse positive definite matrix estimation

E-ISSN： 1932-1872|6|5|431-442

ISSN： 1932-1864

Source： STATISTICAL ANALYSIS AND DATA MINING (ELECTRONIC), Vol.6, Iss.5, 2013-10, pp. : 431-442

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An algorithm for computing positive definite solutions of the nonlinear matrix equation X + A * X -1 A = I

By El-Sayed S.

International Journal of Computer Mathematics, Vol. 80, Iss. 12, 2003-12 ,pp. : 1527-1534

Taylor & Francis Ltd

Access to resources Recommend Favorite

Positive definite matrix approximation with condition number constraint

By Tanaka Mirai Nakata Kazuhide

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 939-947

Springer Publishing Company

Access to resources Recommend Favorite

Reducing the bandwidth of a sparse matrix with a genetic algorithm

By Pop Petrică Matei Oliviu Comes Călin-Adrian

Optimization, Vol. 63, Iss. 12, 2014-12 ,pp. : 1851-1876

Taylor & Francis Ltd

Access to resources Recommend Favorite

Some investigation on Hermitian positive-definite solutions of a nonlinear matrix equation

By Pei Weijuan Wu Guoxing Zhou Duanmei Liu Yitian

International Journal of Computer Mathematics, Vol. 91, Iss. 5, 2014-05 ,pp. : 872-880

Taylor & Francis Ltd

Access to resources Recommend Favorite

Expansion of weighted pseudoinverse matrices with positive definite weights into matrix power products. Iterative methods

By Sergienko I. Galba E. Deineka V.

Cybernetics and Systems Analysis, Vol. 43, Iss. 1, 2007-01 ,pp. : 34-49

Springer Publishing Company

Access to resources Recommend Favorite