Results 11 to 20 of about 98,087 (266)
A quasi-Newton modified LP-Newton method [PDF]
We consider a method to solve constrained system of nonlinear equations based on a modification of the Linear-Programming-Newton method and replacing the first-order information with a quasi-Newton secant update, providing a computationally simple method.
Fernández Ferreyra, Damián Roberto +1 more
core +3 more sources
A nonmonotone inexact Newton method [PDF]
In this paper, we describe a variant of the inexact Newton method for solving nonlinear systems of equations.We define a nonmonotone inexact Newton step and a nonmonotone backtracking strategy.
Silvia Bonettini, BONETTINI, Silvia
core +4 more sources
An investigation of Newton-Sketch and subsampled Newton methods [PDF]
Sketching, a dimensionality reduction technique, has received much attention in the statistics community. In this paper, we study sketching in the context of Newton's method for solving finite-sum optimization problems in which the number of variables and data points are both large.
Albert S. Berahas +2 more
openaire +2 more sources
In this work, we present a program in the computational environment, GeoGebra, that enables a graphical study of Newton's Method. Using this computational device, we will analyze Newton's Method convergence applied to various examples of real functions. Then, it will be given a guide to the construction of the program in GeoGebra.
Orizon P. Ferreira, Davi A. Pires
openaire +2 more sources
Multihomogeneous Newton methods [PDF]
We study multihomogeneous analytic functions and a multihomogeneous Newton’s method for finding their zeros. We give a convergence result for this iteration and we study two examples: the evaluation map and the generalized eigenvalue problem.
Jean-Pierre Dedieu, Mike Shub
openaire +2 more sources
Many machine learning models involve solving optimization problems. Thus, it is important to deal with a large-scale optimization problem in big data applications. Recently, subsampled Newton methods have emerged to attract much attention due to their efficiency at each iteration, rectified a weakness in the ordinary Newton method of suffering a high ...
Ye, Haishan, Luo, Luo, Zhang, Zhihua
openaire +4 more sources
A generalized multivariable Newton method [PDF]
AbstractIt is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a larger convergence region as well as more desirable properties near a solution.
Regina S. Burachik +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Owe Axelsson, Stanislav Sysala
openaire +2 more sources
AbstractNewton's method is one of the most powerful techniques for solving systems of nonlinear equations and minimizing functions. It is easy to implement and has a provably fast rate of convergence under fairly mild assumptions. Because of these and other nice properties, Newton's method is at the heart of many solution techniques used to solve real ...
openaire +2 more sources
On the convergence of newton's method
Sei \(P_ d\) die Menge aller Polynome von Grad d mit komplexen Koeffizienten, deren Nullstellen in der Einheitskreisscheibe liegen. Sei ferner \(\Gamma_ f\) die Menge aller Startpunkte für die das Newtonverfahren zur Lösung \(f(z)=0\) konvergiert. Seien \(B_ 2(0)\) die Kreisscheibe um 0 vom Radius 2, \(A_ f=\mu (\Gamma_ f\cap B_ 2(0))/\mu (B_ 2(0 ...
openaire +2 more sources

