Results 71 to 80 of about 13,152,720 (196)
A geometric modification to the Newton-Secant method to obtain the root of a nonlinear equation is described and analyzed. With the same number of evaluations, the modified method converges faster than Newton’s method and the convergence order of the new
Gustavo Fernández-Torres
doaj +1 more source
ROBUST QUASI-NEWTON EQUATIONS IN QUASI-NEWTON METHOD FOR SOLVING UNCONSTRAINED OPTIMIZATION PROBLEMS
Quasi-Newton methods are among the most widely used and effective general-purpose algorithms for unconstrained optimization. These methods traditionally rely on the quasi-Newton equation, which serves as the foundation for updating approximations of the
Basim A. Hassan, Manal I. Mohammed
doaj +1 more source
Constructive conditions for the existence of a nonlinear Noether integral-differential boundary value problem are found. An iterative scheme with quadratic convergence is constructed to find the solution of a nonlinear integral-differential boundary ...
С. М. Чуйко +2 more
doaj +1 more source
Modified Jacobian Newton Iterative Method: Theory and Applications [PDF]
This article proposes a new approach to the construction of a linearization method based on the iterative operator‐splitting method for nonlinear differential equations. The convergence properties of such a method are studied. The main features of the proposed idea are the linearization of nonlinear equations and the application of iterative splitting ...
openaire +2 more sources
The 6- DOF joint robot with offset wrist can’t satisfy the Pieper rule,thus there are no closed- form inverse kinematics solutions for them. Compared with non- offset robot,a numerical iterative algorithm that integrates the closed- form inverse ...
Han Lei, Diao Yan, Zhang Xibin, Luo Hua
doaj
Conjugate gradient (CG) algorithms play an important role in solving large-scale unconstrained optimization problems due to their low memory requirements and strong convergence properties.
Basim A. Hassan +3 more
doaj +1 more source
Modified Gauss-Newton Algorithms under Noise
Gauss-Newton methods and their stochastic version have been widely used in machine learning and signal processing. Their nonsmooth counterparts, modified Gauss-Newton or prox-linear algorithms, can lead to contrasting outcomes when compared to gradient ...
Pillutla, Krishna +3 more
core
Modified Newton method for reactive dispatching
Abstract This paper describes a new approach to the optimal reactive dispatch problem, based on an augmented Lagrangian function of the original problem. The Karush–Kuhn–Tucker (KKT) optimality conditions are solved by the modified Newton method. The second-order information in the original system of equations is approximated and the first-order ...
openaire +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
Tangent modulus in numerical integration of constitutive relations and its influence on convergence of N-R method [PDF]
For the numerical solution of elasto-plastic problems with use of Newton-Raphson method in global equilibrium equation it is necessary to determine the tangent modulus in each integration point. To reach the parabolic convergence of Newton-Raphson method
Poruba Z., Halama R.
doaj

