On q-BFGS algorithm for unconstrained optimization problems
Open Access
- 12 November 2020
- journal article
- research article
- Published by Springer Nature in Advances in Difference Equations
- Vol. 2020 (1) , 1-24
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–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
This publication has 41 references indexed in Scilit:
- Existence of solutions for k‐dimensional system of multi‐term fractional q‐integro‐differential equations under anti‐periodic boundary conditions via quantum calculusMathematical Methods in the Applied Sciences, 2020
- Positive solutions of fractional differential equation with two pieces in chain interval and simultaneous Dirichlet boundary conditionsBoundary Value Problems, 2019
- Introduction to Unconstrained Optimization with R2019
- A quasi-Newton augmented Lagrangian algorithm for constrained optimization problemsJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology, 2018
- Variable metric algorithms: Necessary and sufficient conditions for identical behavior of nonquadratic functionsJournal of Optimization Theory and Applications, 1972
- On the Convergence of the Variable Metric AlgorithmIMA Journal of Applied Mathematics, 1971
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General ConsiderationsIMA Journal of Applied Mathematics, 1970
- A new approach to variable metric algorithmsThe Computer Journal, 1970
- A family of variable-metric methods derived by variational meansMathematics of Computation, 1970
- Conditioning of quasi-Newton methods for function minimizationMathematics of Computation, 1970