From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization

DOI10.1093/imaiai/iaad017arXiv2112.05273MaRDI QIDQ6164739

Wotao Yin, Qiuwei Li, Daniel McKenzie

Publication date: 28 July 2023

Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)

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

zbMATH Keywords

Hadamard productprojectionnonconvexsimplexcompressive sensinglandscape

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (2)

Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints ⋮ Anomaly detection in the probability simplex under different geometries

This page was built for publication: From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization