Sciweavers

1177 search results - page 24 / 236
» Iterative methods for Robbins problems
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 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
IROS
2006
IEEE
100views Robotics» more  IROS 2006»
14 years 1 months ago
Gait Generation for Passive Running via Iterative Learning Control
Abstract— This paper proposes a novel framework to generate optimal passive gait trajectories for a planar one-legged hopping robot via iterative learning control. The proposed m...
Satoshi Satoh, Kenji Fujimoto, Sang-Ho Hyon
PC
2002
137views Management» more  PC 2002»
13 years 7 months ago
The Chebyshev iteration revisited
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
Martin H. Gutknecht, Stefan Röllin
NA
2010
118views more  NA 2010»
13 years 5 months ago
Practical Quasi-Newton algorithms for singular nonlinear systems
Quasi-Newton methods for solving singular systems of nonlinear equations are considered in this paper. Singular roots cause a number of problems in implementation of iterative met...
Sandra Buhmiler, Natasa Krejic, Zorana Luzanin
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
14 years 8 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...