Results 141 to 150 of about 21,430,598 (179)
Some of the next articles are maybe not open access.
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
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
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 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 ((x n
Dominique Azé, C. C. Chou
openaire +3 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
A proximal Newton-type method for equilibrium problems
Optimization Letters, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pedro Jorge Sousa dos Santos +2 more
openaire +3 more sources
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
A Newton-Type Method and Applications
2018The framework of asymptotic analysis in singularly perturbed geometrical domains can be employed to produce two-term asymptotic expansions for a class of shape functionals. In Chap. 6 one-term expansions of functionals are required for algorithms of shape-topological optimization.
Antonio André Novotny +2 more
openaire +1 more source
Weak convergence conditions for Inexact Newton-type methods
Applied Mathematics and Computation, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ioannis K. Argyros, Saïd Hilout
openaire +2 more sources
Two-sided approximation for some Newton’s type methods
Applied Mathematics and Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tugal Zhanlav +2 more
openaire +3 more sources