Results 11 to 20 of about 827,272 (299)
Newton-type Methods in Array Processing
Despite 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
Selva, J.
core +3 more sources
The Convergence of a Class of Parallel Newton-Type Iterative Methods [PDF]
A general iterative process is proposed, from which a class of parallel Newton-type iterative methods can be derived. A unified convergence theorem for the general iterative process is established.
Qinglong Huang
core +3 more sources
Order of Convergence and Dynamics of Newton–Gauss-Type Methods
On the basis of the new iterative technique designed by Zhongli Liu in 2016 with convergence orders of three and five, an extension to order six can be found in this paper. The study of high-convergence-order iterative methods under weak conditions is of
Ramya Sadananda +3 more
doaj +1 more source
Newton-type multilevel optimization method [PDF]
Inspired by multigrid methods for linear systems of equations, multilevel optimization methods have been proposed to solve structured optimization problems. Multilevel methods make more assumptions regarding the structure of the optimization model, and as a result, they outperform single-level methods, especially for large-scale models.
Chin Pang Ho +2 more
openaire +3 more sources
Gauss–Newton-type methods for bilevel optimization [PDF]
AbstractThis article studies Gauss–Newton-type methods for over-determined systems to find solutions to bilevel programming problems. To proceed, we use the lower-level value function reformulation of bilevel programs and consider necessary optimality conditions under appropriate assumptions.
Jörg Fliege +2 more
openaire +3 more sources
Interval Methods of Newton Type for Nonlinear Equations
[Dimitrova Neli S.; Димитрова Нели С.]; [Markov Svetoslav M.; Марков Светослав М.]Two interval iteration methods of Newton type for finding real zeros of nonlinear equations are formulated and their convergence is investigated.
Dimitrova, Neli S., Markov, Svetoslav M.
core +3 more sources
A Newton‐type method and its application [PDF]
We prove an existence and uniqueness theorem for solving the operator equation F(x) + G(x) = 0, where F is a continuous and Gâteaux differentiable operator and the operator G satisfies Lipschitz condition on an open convex subset of a Banach space. As corollaries, a recent theorem of Argyros (2003) and the classical convergence theorem for modified ...
V. Antony Vijesh, P. V. Subrahmanyam
openaire +3 more sources
A Combined Conjugate Gradient Quasi-Newton Method with Modification BFGS Formula
The conjugate gradient and Quasi-Newton methods have advantages and drawbacks, as although quasi-Newton algorithm has more rapid convergence than conjugate gradient, they require more storage compared to conjugate gradient algorithms.
Mardeen Sh. Taher, Salah G. Shareef
doaj +1 more source
Hybrid Newton-type method for a class of semismooth equations [PDF]
In this paper, we present a hybrid method for the solution of a class of composite semismooth equations encountered frequently in applications. The method is obtained by combining a generalized finite-difference Newton method to an inexpensive direct ...
Pieraccini, Sandra
core +1 more source
FedDANE: A Federated Newton-Type Method [PDF]
Asilomar Conference on Signals, Systems, and Computers ...
Tian Li 0005 +5 more
openaire +2 more sources

