.png){kind=icon}
.png){kind=icon}
Return
On q-BFGS algorithm for unconstrained optimization problems
.png){kind=icon}
OA
AI
DOI：10.1186/s13662-020-03100-2.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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-Fletcher-Goldfarb-Shanno algorithm where the Hessian is constructed using the q-gradient and descent direction is found at each iteration. The algorithm presented in this paper is implemented by applying the independent parameter q in the Armijo-Wolfe conditions to compute the step length which guarantees that the objective function value decreases. The global convergence is established without the convexity assumption on the objective function. Further, the proposed method is verified by the numerical test problems and the results are depicted through the performance profiles.
Keywords:
Unconstrained optimization
BFGS method
q-calculus
Global convergence
90C30
65K05
05A40
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.1
Papers:
4.8K
Citations:
7.4K
View more organizations