30 search results - page 2 / 6 » Sub-Sampled Newton Methods I: Globally Convergent Algorithms |
SIAMJO
2008
13 years 4 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
MP
2002
13 years 4 months ago
2002
The asymptotic convergence of parameterized variants of Newton's method for the solution of nonlinear systems of equations is considered. The original system is perturbed by a...
IJISTA
2007
13 years 4 months ago
2007
: We propose a novel algorithm to register multiple 3D point sets within a common reference frame simultaneously. Our approach performs an explicit optimisation on the manifold of ...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
AE
2005
Springer
13 years 10 months ago
2005
Springer
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...