Results 1 to 10 of about 98,087 (266)
Historical Development of the Newton–Raphson Method
This expository paper traces the development of the Newton-Raphson method for solving nonlinear algebraic equations through the extant notes, letters, and publications of Isaac Newton, Joseph Raphson, and Thomas Simpson.
Tjalling J Ypma
exaly +2 more sources
Newton method over networks is fast up to the statistical precision [PDF]
We propose a distributed cubic regularization of the Newton method for solving (constrained) empirical risk minimization problems over a network of agents, modeled as undirected graph.
Scutari, Gesualdo +3 more
core +1 more source
Hybrid Newton-type method for a class of semismooth equations [PDF]
In this paper, we present a hybrid method for the solution of a class of composite semismooth equations encountered frequently in applications. The method is obtained by combining a generalized finite-difference Newton method to an inexpensive direct ...
Pieraccini, Sandra
core +1 more source
We apply sequential Bayesian inference with a discriminatively specified observation model to the subsampled gradients and Hessians used by the stochastic Newton method for online ...
Michael C. Burkhart (6643982)
core +1 more source
A semismooth newton method for the nearest Euclidean distance matrix problem
The Nearest Euclidean distance matrix problem (NEDM) is a fundamentalcomputational problem in applications such asmultidimensional scaling and molecularconformation from nuclear magnetic resonance data in computational chemistry.Especially in the latter ...
Qi, Houduo
core +1 more source
Learning regularized Gauss-Newton methods
We consider variational networks for a class of nonlinear-ill-posed least squares inverse problems. These problems are addressed by regularized Gauss-Newton type optimization algorithms where the regularization is learned by a neural network.
Francesco Colibazzi +3 more
core
textRoot-finding algorithms have been studied for ages for their various applications. Newton's Method is just one of these root-finding algorithms.
Banacka, Nicole Lynn
core
Pseudo-loadflow formulation as a starting process for the Newton Raphson
This paper introduces new models which approximate the AC loadflow problem, but are able to converge (using the Newton Raphson algorithm) from a wider range of starting points.
Irving, MR
core +1 more source
Fractional Newton-Raphson Method
The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In the present work,
Brambila Paz, Fernando +3 more
core +1 more source
A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs [PDF]
[[abstract]]We present a smooth approximation for the generalized Fischer-Burmeister function where the 2-norm in the FB function is relaxed to a general p-norm (p > 1), and establish some favorable properties for it, for example, the Jacobian ...
Tzu-Ching Lin, 林子靖
core +1 more source

