Results 21 to 30 of about 17,094,571 (296)

Inexact Newton-type methods

open access: yesJournal of Complexity, 2010
Inexact Newton-type methods are discussed for approximating a locally unique solution of the nonlinear equation \(A(x)^{\#}(F(x)+G(x))=0\) in Banach space. Here \(F\) is a Fréchet-differentiable operator, \(G\) is a continuous operator and \(A(x)^{\#}\) is an analog of the Moore-Penrose generalized inverse of \(A(x)\) which is an approximation of the ...
Ioannis K. Argyros, Saïd Hilout
openaire   +3 more sources

FedDANE: A Federated Newton-Type Method [PDF]

open access: yes2019 53rd Asilomar Conference on Signals, Systems, and Computers, 2019
Asilomar Conference on Signals, Systems, and Computers ...
Tian Li 0005   +5 more
openaire   +3 more sources

Newton-type methods for simultaneous matrix diagonalization

open access: yesCalcolo, 2022
This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable system of equations associated to this problem, we construct a sequence that converges quadratically towards the ...
Rima Khouja   +2 more
openaire   +3 more sources

Newton-type Methods for Minimax Optimization

open access: yesCoRR, 2020
Differential games, in particular two-player sequential zero-sum games (a.k.a. minimax optimization), have been an important modeling tool in applied science and received renewed interest in machine learning due to many recent applications, such as adversarial training, generative models and reinforcement learning.
Guojun Zhang   +3 more
openaire   +3 more sources

DINO: Distributed Newton-Type Optimization Method [PDF]

open access: yes, 2020
We present a novel communication-efficient Newton-type algorithm for finite-sum optimization over a distributed computing environment. Our method, named DINO, overcomes both theoretical and practical shortcomings of similar existing methods. Under minimal assumptions, we guarantee global sub-linear convergence of DINO to a first-order stationary point ...
Crane, Rixon, Roosta, Fred
openaire   +4 more sources

Pseudo-loadflow formulation as a starting process for the Newton Raphson [PDF]

open access: yes, 2010
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

On the Convergence Rate of Quasi-Newton Methods on Strongly Convex Functions with Lipschitz Gradient

open access: yesMathematics, 2023
The main results of the study of the convergence rate of quasi-Newton minimization methods were obtained under the assumption that the method operates in the region of the extremum of the function, where there is a stable quadratic representation of the ...
Vladimir Krutikov   +3 more
doaj   +1 more source

Learning regularized Gauss-Newton methods

open access: yes, 2022
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   +1 more source

Third-Order Newton-Type Methods Combined with Vector Extrapolation for Solving Nonlinear Systems

open access: yesAbstract and Applied Analysis, 2014
We present a third-order method for solving the systems of nonlinear equations. This method is a Newton-type scheme with the vector extrapolation. We establish the local and semilocal convergence of this method.
Wen Zhou, Jisheng Kou
doaj   +1 more source

How to Obtain Global Convergence Domains via Newton’s Method for Nonlinear Integral Equations

open access: yesMathematics, 2019
We use the theoretical significance of Newton’s method to draw conclusions about the existence and uniqueness of solution of a particular type of nonlinear integral equations of Fredholm.
José Antonio Ezquerro   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy