Results 1 to 10 of about 124,946 (301)
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 +3 more sources
Quasi-Newton’s method for multiobjective optimization
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
An Approximate Quasi-Newton Bundle-Type Method for Nonsmooth Optimization [PDF]
An implementable algorithm for solving a nonsmooth convex optimization problem is proposed by combining Moreau-Yosida regularization and bundle and quasi-Newton ideas. In contrast with quasi-Newton bundle methods of Mifflin et al.
Jie Shen, Li-Ping Pang, Dan Li
doaj +2 more sources
Continual Learning with Quasi-Newton Methods [PDF]
<p>In this paper, we propose CSQN, a new Continual Learning (CL) method which considers Quasi-Newton methods, more specifically, Sampled Quasi-Newton methods, to extend EWC.</p> <p>EWC uses a Bayesian framework to estimate which parameters are important to previous tasks, and it punishes changes made to these parameters.
Vander Eeckt, Steven, Van Hamme, Hugo
openaire +3 more sources
Studies on modified limited-memory BFGS method in full waveform inversion
Full waveform inversion (FWI) is a non-linear optimization problem based on full-wavefield modeling to obtain quantitative information of subsurface structure by minimizing the difference between the observed seismic data and the predicted wavefield. The
Meng-Xue Dai +3 more
doaj +1 more source
Partial Davidon, Fletcher and Powell (DFP) of quasi newton method for unconstrained optimization
The nonlinear Quasi-newton methods is widely used in unconstrained optimization. However, In this paper, we developing new quasi-Newton method for solving unconstrained optimization problems.
Basheer M. Salih +2 more
doaj +1 more source
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
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 +2 more sources
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

