Sciweavers

1997 search results - page 28 / 400
» On the convergence of Hill's method
Sort
View
MOC
2000
94views more  MOC 2000»
13 years 8 months ago
A new summation method for power series with rational coefficients
Abstract. We show that an asymptotic summation method, recently proposed by the authors, can be conveniently applied to slowly convergent power series whose coefficients are ration...
Silvia Dassié, Marco Vianello, Renato Zanov...
MOC
2002
77views more  MOC 2002»
13 years 8 months ago
Directional Newton methods in n variables
Directional Newton methods for functions f of n variables are shown to converge, under standard assumptions, to a solution of f(x) = 0. The rate of convergence is quadratic, for ne...
Yuri Levin, Adi Ben-Israel
AUTOMATICA
2006
137views more  AUTOMATICA 2006»
13 years 8 months ago
A Newton-like method for solving rank constrained linear matrix inequalities
This paper presents a Newton-like algorithm for solving systems of rank constrained linear matrix inequalities. Though local quadratic convergence of the algorithm is not a priori...
Robert Orsi, Uwe Helmke, John B. Moore
GECCO
2010
Springer
148views Optimization» more  GECCO 2010»
14 years 1 months ago
Guarding against premature convergence while accelerating evolutionary search
The fundamental dichotomy in evolutionary algorithms is that between exploration and exploitation. Recently, several algorithms [8, 9, 14, 16, 17, 20] have been introduced that gu...
Josh C. Bongard, Gregory S. Hornby
MP
2006
107views more  MP 2006»
13 years 8 months ago
Convergence theory for nonconvex stochastic programming with an application to mixed logit
Monte Carlo methods have been used extensively in the area of stochastic programming. As with other methods that involve a level of uncertainty, theoretical properties are required...
Fabian Bastin, Cinzia Cirillo, Philippe L. Toint