Convex optimization over a probability simplex
We propose a new iteration scheme, the Cauchy-Simplex, to optimize convex problems over the probability simplex ${“w\in\mathbb{R”}^n\ |\ \sum_i w_i=1\ \textrm{“and”}\ w_i\geq0}$. Specifically, we map the simplex to the positive quadrant of a unit sphere, envisage gradient descent in latent variables