On q-BFGS algorithm for unconstrained optimization problems

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...

Descripció completa

Dades bibliogràfiques
Autors principals: Shashi Kant Mishra, Geetanjali Panda, Suvra Kanti Chakraborty, Mohammad Esmael Samei, Bhagwat Ram
Format: Article
Idioma:English
Publicat: SpringerOpen 2020-11-01
Col·lecció:Advances in Difference Equations
Matèries:
Unconstrained optimization
BFGS method
q-calculus
Global convergence
Accés en línia:http://link.springer.com/article/10.1186/s13662-020-03100-2

Internet

http://link.springer.com/article/10.1186/s13662-020-03100-2

Ítems similars