New w-Convergence Conditions for the Newton-Kantorovich Method
, 2020 We present new sufficient semilocal convergence conditions for the Newton-Kantorovich method in order to approximate a locally unique solution of a nonlinear equation in a Banach space setting.
Ioannis K. Argyros; Department of Mathematicsal Sciences, Cameron University, Lawton, OK 73505 +1 more
core
Newton's method in Riemannian manifolds
Journal of Numerical Analysis and Approximation Theory, 2008 Using more precise majorizing sequences than before [1], [8], and under the same computational cost, we provide a finer semilocal convergence analysis of Newton's method in Riemannian manifolds with the following advantages: larger convergence domain ...
Ioannis K. Argyros
doaj +2 more sources
Missing link survival analysis with applications to available pandemic data. [PDF]
Comput Stat Data Anal, 2022 Gámiz ML +3 more
europepmc +1 more source
Analytic regularity and stochastic collocation of high-dimensional Newton iterates. [PDF]
Adv Comput Math, 2020 Castrillón-Candás JE, Kon M.
europepmc +1 more source
The generalized Newton--Kantorovich method for equations with nondifferentiable operators
, 2012 11 ...
openaire +2 more sources
The convergence of a Halley-Chebysheff-type method under Newton-Kantorovich hypotheses
Applied Mathematics Letters, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A generalization of the Newton—Kantorovich theorem in a Banach space
, 2018 Побудовано модифікацію класичного методу Ньютона—Канторовича в банаховому просторі. Для знаходження розв’язку нелінійного операторного рівняння отримано ітераційну схему із квадратичною збіжністю.
Чуйко, С.М.
core +1 more source
Convergence analysis for the two-step Newton method of order four
Journal of Numerical Analysis and Approximation Theory, 2014 We provide a tighter than before convergence analysis for the two-step Newton method of order four using recurrent functions. Numerical examples are also provided in this study.
Ioannis K. Argyros, Sanjay K. Khattri
doaj +2 more sources
A Newton Method for Linear Programming [PDF]
, 2002 A fast Newton method is proposed for solving linear programs with a very large ( 106) number of constraints and a moderate ( 102) number of variables. Such linear programs occur in data mining and machine learning.
O. L. Mangasarian, Mangasarian, Olvi
core
Towards a Controllable and Reversible Privacy Protection System for Facial Images through Enhanced Multi-Factor Modifier Networks. [PDF]
Entropy (Basel), 2023 Pan YL, Chen JC, Wu JL.
europepmc +1 more source