On q-BFGS algorithm for unconstrained optimization problems
From MaRDI portal
Publication:2144107
DOI10.1186/S13662-020-03100-2zbMATH Open1487.65067OpenAlexW3101185163MaRDI QIDQ2144107FDOQ2144107
Authors: Geetanjali Panda, Suvra Kanti Chakraborty, M. E. Samei, Bhagwat Ram, S. K. Mishra 
Publication date: 1 June 2022
Published in: Advances in Difference Equations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13662-020-03100-2
Recommendations
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- A \(q\)-conjugate gradient algorithm for unconstrained optimization problems
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
- Global optimization using \(q\)-gradients
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) (q)-calculus and related topics (05A30)
Cites Work
- Testing Unconstrained Optimization Software
- \texttt{qFunctions} -- a Mathematica package for \(q\)-series and partition theory applications
- Benchmarking optimization software with performance profiles.
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- Quantum calculus on finite intervals and applications to impulsive difference equations
- Title not available (Why is that?)
- Applications of \(q\)-calculus in operator theory
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- New quasi-Newton methods for unconstrained optimization problems
- The BFGS method with exact line searches fails for non-convex objective functions
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Convergence Properties of the BFGS Algoritm
- A Modified BFGS Algorithm for Unconstrained Optimization
- System of fractional differential algebraic equations with applications
- Global optimization using \(q\)-gradients
- A Method for q-Calculus
- The \(q\)-gradient vector for unconstrained continuous optimization problems
- Improved \(q\)-exponential and \(q\)-trigonometric functions
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- On the Convergence of the Variable Metric Algorithm
- Collocation methods for fractional differential equations involving non-singular kernel
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- Existence results for a fraction hybrid differential inclusion with Caputo-Hadamard type fractional derivative
- Positive solutions of fractional differential equation with two pieces in chain interval and simultaneous Dirichlet boundary conditions
- Newton like line search method using \(q\)-calculus
- Existence of solutions for \(k\)-dimensional system of multi-term fractional \(q\)-integro-differential equations under anti-periodic boundary conditions via quantum calculus
- Introduction to Unconstrained Optimization with R
- Retracted article: The existence of solution for \(k\)-dimensional system of Langevin Hadamard-type fractional differential inclusions with \(2k\) different fractional orders
- On existence and uniqueness of solutions for a class of coupled system of three term fractional \(q\)-differential equations
- APPROXIMATE ENDPOINT SOLUTIONS FOR A CLASS OF FRACTIONAL q-DIFFERENTIAL INCLUSIONS BY COMPUTATIONAL RESULTS
- Fractional hybrid initial value problem featuring \(q\)-derivatives
Cited In (8)
- A \(q\)-conjugate gradient algorithm for unconstrained optimization problems
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- Time accurate solution to Benjamin-Bona-Mahony-Burgers equation via Taylor-Boubaker series scheme
- Global optimization using \(q\)-gradients
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- A modified Fletcher-Reeves conjugate gradient method for unconstrained optimization with applications in image restoration.
- Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization
- UOBYQA: unconstrained optimization by quadratic approximation
Uses Software
This page was built for publication: On \(q\)-BFGS algorithm for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144107)
