Results 231 to 240 of about 859,071 (262)
Some of the next articles are maybe not open access.
2003
There is no guarantee that the local algorithms in chapters 12 and 13 will converge when they are started at a point x 1 far from a solution x * to problem (P E ) or (P EI ). They can generate erratic sequences, which may by chance enter the neighborhood of a solution and then converge to it; but most often, the sequences will not converge. There exist
J. Frédéric Bonnans +3 more
openaire +1 more source
There is no guarantee that the local algorithms in chapters 12 and 13 will converge when they are started at a point x 1 far from a solution x * to problem (P E ) or (P EI ). They can generate erratic sequences, which may by chance enter the neighborhood of a solution and then converge to it; but most often, the sequences will not converge. There exist
J. Frédéric Bonnans +3 more
openaire +1 more source
A Stochastic Line Search Method with Expected Complexity Analysis
SIAM Journal on Optimization, 2020Katya Scheinberg, Courtney Paquette
exaly
A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
SIAM Journal on Optimization, 2005Hongchao Zhang, William W Hager
exaly
Global convergence of BFGS and PRP methods under a modified weak Wolfe–Powell line search
Applied Mathematical Modelling, 2017Gonglin Yuan, Zengxin Wei
exaly
Convergence of line search methods for unconstrained optimization
Applied Mathematics and Computation, 2004Zhen-Jun Shi
exaly