Results 11 to 20 of about 21,430,598 (179)
Reducing Chaos and Bifurcations in Newton-Type Methods [PDF]
We study the dynamics of some Newton-type iterative methods when they are applied of polynomials degrees two and three. The methods are free of high-order derivatives which are the main limitation of the classical high-order iterative schemes. The iterative schemes consist of several steps of damped Newton's method with the same derivative.
Amat, S. +2 more
openaire +6 more sources
Projected Newton-type Methods in Machine Learning [PDF]
We consider projected Newton-type methods for solving large-scale optimization problems arising in machine learning and related fields. We first introduce an algorithmic framework for projected Newton-type methods by reviewing a canonical projected (quasi-)Newton method.
Schmidt, M., Kim, D., Sra, S.
openaire +4 more sources
The Convergence of a Class of Parallel Newton-Type Iterative Methods [PDF]
A general iterative process is proposed, from which a class of parallel Newton-type iterative methods can be derived. A unified convergence theorem for the general iterative process is established. The convergence of these Newton-type iterative methods is obtained from the unified convergence theorem.
Qinglong Huang
openaire +3 more sources
Newton type methods for solving a Hasegawa–Mima plasma model [PDF]
In Karakazian and Nassif (2019), the non-linear space-time Hasegawa–Mima plasma equation is formulated as a coupled system of two linear PDEs, a solution of which is a pair (u,w), with w=(I−Δ)u.
Nabil R. Nassif +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
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 +1 more source
Pseudo-loadflow formulation as a starting process for the Newton Raphson [PDF]
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
Inexact Newton-Kantorovich Methods for Constrained Nonlinear Model Predictive Control
In this paper we consider Newton-Kantorovich type methods for solving control-constrained optimal control problems that appear in model predictive control. Conditions for convergence are established for an inexact version of the Newton-Kantorovich method
Nicotra, Marco +3 more
core +4 more sources
On mesh independence and Newton-type methods [PDF]
summary:Mesh-independent convergence of Newton-type methods for the solution of nonlinear partial differential equations is discussed. First, under certain local smoothness assumptions, it is shown that by properly relating the mesh parameters $H$ and $h$
Grossmann, Christian +4 more
core +1 more source
Globalized inexact proximal Newton-type methods for nonconvex composite functions
Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term. This particular structure is exploited by the class of proximal gradient methods and some of their generalizations
Lechner, Theresa +3 more
core +1 more source

