Low rank approximation of the symmetric positive semidefinite matrix

descriptionPublicationkeyboard_double_arrow_right Article 01 Apr 2014 English Publisher:Elsevier BVJournal:Journal of Computational and Applied Mathematics, volume 260, pages 236-243 (issn: 0377-0427,

Copyright policy )

Authors: Xuefeng Duan; Jiao-Fen Li; Qingwen Wang 0001; Xinjun Zhang;

doi: 10.1016/j.cam.2013.09.080

Low rank approximation of the symmetric positive semidefinite matrix

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Shanghai University
China (People's Republic of)
Guilin University of Electronic Technology
China (People's Republic of)

Keywords

Numerical optimization and variational techniques, Positive matrices and their generalizations; cones of matrices, feasible set, low rank approximation, Other matrix algorithms, symmetric positive semidefinite matrix, unconstrained optimization, nonlinear conjugate gradient method

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	10
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average