Results 251 to 260 of about 17,902,926 (294)
Some of the next articles are maybe not open access.
Newton-Type Methods for Quasidifferentiable Equations
Journal of Optimization Theory and Applications, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, L. W., Xia, Z. Q.
openaire +2 more sources
On the convergence of an inexact Newton-type method
Operations Research Letters, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guanglu Zhou, Liqun Qi 0001
openaire +1 more source
A quasi-Newton type method for equilibrium problems
Numerical Algorithms, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leonardo A. Sousa +3 more
openaire +3 more sources
Newton-type method for solving generalized inclusion
Numerical Algorithms, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paulo Sérgio Marques dos Santos +2 more
openaire +2 more sources
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 ...
Andreas Potschka
exaly +4 more sources
Newton-Type Methods in Array Processing
IEEE Signal Processing Letters, 2004Despite their good features, Newton-type methods are not usually employed in array processing due to the lack of appropriate formulas for the first- and second-order differentials. One specific property of most array processing models is that each column of the signal matrix depends only on the corresponding element of one or more parameter vectors. In
openaire +3 more sources
On a Newton Type Iterative Method for Solving Inclusions
Mathematics of Operations Research, 1995We introduce a notion of strict differentiability for multifunctions by means of a notion of tangency based on a uniform property of Clarke's tangent cone. Given a multifunction G and a point (a, b) ∈ G and assuming that the derivative DG(a, b) is surjective and has a bounded inverse, we build a sequence ((xn, yn)) ⊂ G, such that d(xn+1 − xn, DG(a, b)−
Dominique Azé, C. C. Chou
openaire +3 more sources
A note on Newton type iterative methods
Computing, 1984Some particular real functions are related to the so called Newton type iterative processes, i.e. iterations of the form \(x_{n+1}=x_ n-A(x_ n)^{-1}F(x_ n),\) which solve nonlinear operator equations in Banach spaces. This allows to obtain, at the same time, convergence conditions and a posteriori error estimates.
openaire +4 more sources
On a two-step relaxed Newton-type method
Applied Mathematics and Computation, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergio Amat +2 more
openaire +1 more source
Newton’s method has long been enjoying its position as the algorithm of choice for solving nonlinear equations and unconstrained optimization problems. In classical Euclidean settings, under strong smoothness assumptions, the local quadratic convergence has allowed for a reduced number of oracle calls.
Pinta, Titus +5 more
openaire +2 more sources
Pinta, Titus +5 more
openaire +2 more sources