59 search results - page 9 / 12 » A spectral bundle method with bounds |
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
103
click to vote
CORR
2010
Springer
15 years 20 days ago
2010
Springer
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
97
Voted
MOR
2008
15 years 16 days ago
2008
We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in ...
107
Voted
SIAMJO
2008
15 years 15 days ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
110
click to vote
ISMIR
2005
Springer
15 years 6 months ago
2005
Springer
This paper proposes an algorithm for studying spectral contents of pitched sounds in real-world recordings. We assume that the 2nd -order difference, w.r.t. partial index, of a pi...