On q-BFGS algorithm for unconstrained optimization problems
Abstract Variants of the Newton method are very popular for solving unconstrained optimization problems. The study on global convergence of the BFGS method has also made good progress. The q-gradient reduces to its classical version when q approaches 1. In this paper, we propose a quantum-Broyden–Fl...
Main Authors: | Shashi Kant Mishra, Geetanjali Panda, Suvra Kanti Chakraborty, Mohammad Esmael Samei, Bhagwat Ram |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2020-11-01
|
Series: | Advances in Difference Equations |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13662-020-03100-2 |
Similar Items
-
A Modified q-BFGS Algorithm for Unconstrained Optimization
by: Kin Keung Lai, et al.
Published: (2023-03-01) -
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
by: Shashi Kant Mishra, et al.
Published: (2021-01-01) -
A Modified Globally Convergent Self-Scaling BFGS Algorithm for Unconstrained Optimization
by: Abbas Y. AL-Bayati, et al.
Published: (2012-09-01) -
A modified nonmonotone BFGS algorithm for unconstrained optimization
by: Xiangrong Li, et al.
Published: (2017-08-01) -
A Conjugate Gradient Method: Quantum Spectral Polak–Ribiére–Polyak Approach for Unconstrained Optimization Problems
by: Kin Keung Lai, et al.
Published: (2023-12-01)