560 search results - page 23 / 112 » Level-set methods for convex optimization |
107
click to vote
WCE
2007
15 years 3 months ago
2007
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
144
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
103
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We develop and analyze M-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variatio...
119
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
104
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
In this paper we explore avenues for improving the reliability of dimensionality reduction methods such as Non-Negative Matrix Factorization (NMF) as interpretive exploratory data...