Results 61 to 70 of about 59,325 (162)

NEW CONJUGATE GRADIENT METHOD FOR ACCELERATED CONVERGENCE AND COMPUTATIONAL EFFICIENCY IN UNCONSTRAINED OPTIMIZATION PROBLEMS

Barekeng
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, Alaa Luqman Ibrahim, Thaair A. Ameen, Ibrahim Mohammed Sulaiman   +3 more
doaj   +1 more source

Backward Step Control for Global Newton-Type Methods

SIAM Journal on Numerical Analysis, 2016
Summary: We present and analyze a new damping approach called backward step control for the globalization of the convergence of Newton-type methods for the numerical solution of nonlinear root-finding problems. We provide and discuss reasonable assumptions that imply convergence of backward step control on the basis of generalized Newton paths in ...
openaire   +2 more sources

Modifications for Quasi-Newton Method and Its Spectral Algorithm for Solving Unconstrained Optimization Problems

مجلة بغداد للعلوم
In this paper, two modifications for spectral quasi-Newton algorithm of type BFGS are imposed. In the first algorithm, named SQNEI, a certain spectral parameter is used in such a step for BFGS algorithm differs from other presented algorithms.
Evar Lutfalla Sadraddin, Ivan Subhi Latif   +1 more
doaj   +1 more source

Convergence and Stability Improvement of Quasi-Newton Methods by Full-Rank Update of the Jacobian Approximates

AppliedMath
A system of simultaneous multi-variable nonlinear equations can be solved by Newton’s method with local q-quadratic convergence if the Jacobian is analytically available.
Peter Berzi
doaj   +1 more source

On the Kantorovich Theory for Nonsingular and Singular Equations

Axioms
We develop a new Kantorovich-like convergence analysis of Newton-type methods to solve nonsingular and singular nonlinear equations in Banach spaces.
Ioannis K. Argyros, Santhosh George, Samundra Regmi, Michael I. Argyros   +3 more
doaj   +1 more source

Interval methods of Newton type for nonlinear equations

, 1983
Es sei f:[a,b]\(\subset {\mathbb{R}}\to {\mathbb{R}}\); zu bestimmen ist eine Nullstelle \(x^*\in [a,b]\) mit \(f(x^*)=0\). Dazu werden zwei Intervall- Newton-Verfahren angegeben und ihre Verwirklichung durch eine passende, einseitig rundende Computer-Arithmetik beschrieben.
Dimitrova, Neli S., Markov, Svetoslav M.
openaire   +2 more sources

Newton-Kantorovitch method for decoupled forward-backward stochastic differential equations

Electronic Journal of Differential Equations, 2021
Dai Taguchi, Takahiro Tsuchiya
doaj  

Inexact Newton-type Methods for Optimisation with Nonnegativity Constraints

We consider solving large scale nonconvex optimisation problems with nonnegativity constraints. Such problems arise frequently in machine learning, such as nonnegative least-squares, nonnegative matrix factorisation, as well as problems with sparsity-inducing regularisation.
Smee, Oscar, Roosta, Fred
openaire   +4 more sources

Isolated Calmness of Perturbation Mappings and Superlinear Convergence of Newton-Type Methods. [PDF]

J Optim Theory Appl
Benko M, Mehlitz P.
europepmc   +1 more source

A novel adaptive quasi-Newton-type update and its global convergence without Lipschitz condition for constrained system of nonlinear monotone equations. [PDF]

PLoS One
Ahmed K, Semary HE, Al-Moisheer AS, Ibrahim SM, Halilu AS, Waziri MY, Mohamed MA, Murtala S.   +7 more
europepmc   +1 more source