Methods for Sparse and Low-Rank Recovery under Simplex Constraints
From MaRDI portal
Publication:5109909
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
sparsityD.C. programmingsimplex constraintsestimation of mixture proportionsdensity matrices of quantum systems
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