Sciweavers

101 search results - page 1 / 21
» Newton's iterates can converge to non-stationary points
Sort
View
MP
2008
82views more  MP 2008»
13 years 4 months ago
Newton's iterates can converge to non-stationary points
Abstract In this note we discuss the convergence of Newton's method for minimization. We present examples in which the Newton iterates satisfy the Wolfe conditions and the Hes...
Walter F. Mascarenhas
SIAMJO
2000
76views more  SIAMJO 2000»
13 years 4 months ago
Superlinear Convergence and Implicit Filtering
In this note we show how the implicit filtering algorithm can be coupled with the BFGS quasi-Newton update to obtain a superlinearly convergent iteration if the noise in the object...
T. D. Choi, C. T. Kelley
SIAMJO
2010
88views more  SIAMJO 2010»
12 years 11 months ago
A Primal-Dual Exterior Point Method for Nonlinear Optimization
In this paper, a primal dual method for general possible nonconvex nonlinear optimization problems is considered. The method is an exterior point type method which means that it p...
Hiroshi Yamashita, Takahito Tanabe
ECCV
2006
Springer
14 years 6 months ago
Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence
We give the first complete theoretical convergence analysis for the iterative extensions of the Sturm/Triggs algorithm. We show that the simplest extension, SIESTA, converges to no...
John Oliensis, Richard Hartley
ENTCS
2008
91views more  ENTCS 2008»
13 years 4 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra