Sciweavers

1797 search results - page 99 / 360
» Regularized Winnow Methods
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 10 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis
CORR
2006
Springer
89views Education» more  CORR 2006»
14 years 10 months ago
On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches
In this paper, we investigate the efficiency of various strategies for subdividing polynomial triangular surface patches. We give a simple algorithm performing a regular subdivisio...
Jean H. Gallier
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
15 years 10 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
COMPUTING
2007
122views more  COMPUTING 2007»
14 years 10 months ago
Error estimation for Bregman iterations and inverse scale space methods in image restoration
In this paper we consider error estimation for image restoration problems based on generalized Bregman distances. This error estimation technique has been used to derive convergen...
Martin Burger, E. Resmerita, Lin He
MOR
2010
120views more  MOR 2010»
14 years 8 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...