In this paper, we investigate the convergence properties of the stochast...
The widely used stochastic gradient methods for minimizing nonconvex
com...
In this paper, we present a comprehensive study on the convergence prope...
Optimization over the embedded submanifold defined by constraints c(x) =...
We consider polynomial optimization problems (POP) on a semialgebraic se...
In this paper we study the computation of the nonparametric maximum
like...
This work proposes a rapid global solver for nonconvex low-rank matrix
f...
We consider solving high-order semidefinite programming (SDP) relaxation...
Motivated by the observation that the ability of the ℓ_1 norm in
promoti...
Estimation of Gaussian graphical models is important in natural science ...
Shape-constrained convex regression problem deals with fitting a convex
...
In this paper, we consider high-dimensional nonconvex square-root-loss
r...
The exclusive lasso regularization based on the ℓ_1,2 norm has become
po...
Clustering is a fundamental problem in unsupervised learning. Popular me...
In this paper, we consider the problem of computing a Wasserstein baryce...
We focus on solving the clustered lasso problem, which is a least square...
Clustering may be the most fundamental problem in unsupervised learning ...
This paper studies the matrix completion problem under arbitrary samplin...
Low-rank matrix completion is a problem of immense practical importance....