Results 21 to 30 of about 12,439,104 (289)
Quasi-Newton-based nonlinear finite element methods were extensively studied in the 1970s and 1980s. However, they have almost disappeared due to their poorer convergence performance than the Newton-Raphson method.
Yasunori YUSA +2 more
doaj +1 more source
Decentralized Quasi-Newton Methods [PDF]
We introduce the decentralized Broyden-Fletcher-Goldfarb-Shanno (D-BFGS) method as a variation of the BFGS quasi-Newton method for solving decentralized optimization problems. The D-BFGS method is of interest in problems that are not well conditioned, making first order decentralized methods ineffective, and in which second order information is not ...
Mark Eisen +2 more
openaire +3 more sources
Partial Pearson-two (PP2) of quasi newton method for unconstrained optimization
In this paper, we developing new quasi-Newton method for solving unconstrained optimization problems .The nonlinear Quasi-newton methods is widely used in unconstrained optimization[1]. However,.
Basheer M. Salih +2 more
doaj +1 more source
Faster Stochastic Quasi-Newton Methods [PDF]
Stochastic optimization methods have become a class of popular optimization tools in machine learning. Especially, stochastic gradient descent (SGD) has been widely used for machine learning problems such as training neural networks due to low per-iteration computational complexity.
Qingsong Zhang +3 more
openaire +3 more sources
THE NEW RANK ONE CLASS FOR UNCONSTRAINED PROBLEMS SOLVING
One of the most well-known methods for unconstrained problems is the quasi-Newton approach, iterative solutions. The great precision and quick convergence of the quasi-Newton methods are well recognized. In this work, the new algorithm for the symmetric
Ahmed Mustafa
doaj +1 more source
Matrix Transformations and Quasi-Newton Methods [PDF]
We first recall some properties of infinite tridiagonal matrices considered as matrix transformations in sequence spaces of the formssξ,sξ∘,sξ(c), orlp(ξ). Then, we give some results on the finite section method for approximating a solution of an infinite linear system.
Boubakeur Benahmed +2 more
openaire +4 more sources
Correlation and realization of quasi-Newton methods of absolute optimization [PDF]
Newton and quasi-Newton methods of absolute optimization based on Cholesky factorization with adaptive step and finite difference approximation of the first and the second derivatives.
Anastasiya Borisovna Sviridenko +1 more
doaj +1 more source
On the Convergence Rate of Quasi-Newton Methods on Strongly Convex Functions with Lipschitz Gradient
The main results of the study of the convergence rate of quasi-Newton minimization methods were obtained under the assumption that the method operates in the region of the extremum of the function, where there is a stable quadratic representation of the ...
Vladimir Krutikov +3 more
doaj +1 more source
Gradient-based methods are popularly used in training neural networks and can be broadly categorized into first and second order methods. Second order methods have shown to have better convergence compared to first order methods, especially in solving ...
S. Indrapriyadarsini +4 more
doaj +1 more source
The Symmetric Rank-One Quasi-Newton Method is a Space Dilation Subgradient Algorithm [PDF]
The Symmetric Rank-One Quasi-Newton Method is a Space Dilation Subgradient ...
Todd, M.
core +4 more sources

