928 search results - page 31 / 186 » The Rate of Convergence of AdaBoost |
CISS
2008
IEEE
14 years 5 months ago
2008
IEEE
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
FOCM
2010
13 years 9 months ago
2010
One of the most widely used methods for eigenvalue computation is the QR iteration with Wilkinson’s shift: here the shift s is the eigenvalue of the bottom 2 × 2 principal mino...
SIAMJO
2010
13 years 9 months ago
2010
In this paper, we propose a hybrid Gauss-Newton structured BFGS method with a new update formula and a new switch criterion for the iterative matrix to solve nonlinear least square...
IMCSIT
2010
13 years 8 months ago
2010
The authors consider the impact of the structure of the matrix on the convergence behavior for the GMRES projection method for solving large sparse linear equation systems resultin...
DAGSTUHL
2007
14 years 12 days ago
2007
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal sc...