Methods for Sparse and Low-Rank Recovery under Simplex Constraints

DOI10.5705/ss.202016.0220zbMath1439.62138arXiv1605.00507OpenAlexW2962794632WikidataQ129748260 ScholiaQ129748260MaRDI QIDQ5109909

Ping Li, Syama Sundar Rangapuram, Martin Slawski

Publication date: 14 May 2020

Published in: Statistica Sinica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00507

zbMATH Keywords

sparsityD.C. programmingsimplex constraintsestimation of mixture proportionsdensity matrices of quantum systems

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Applications of statistics to physics (62P35)

Related Items (2)

Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization ⋮ DC programming and DCA: thirty years of developments

This page was built for publication: Methods for Sparse and Low-Rank Recovery under Simplex Constraints