Global optimization using \(q\)-gradients
From MaRDI portal
Publication:322763
DOI10.1016/j.ejor.2016.01.001zbMath1346.90679OpenAlexW2237275262MaRDI QIDQ322763
Aline C. Soterroni, Érica J. C. Gouvêa, Marluce C. Scarabello, Rommel G. Regis, Fernando Manuel Ramos
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.01.001
Related Items (4)
On \(q\)-BFGS algorithm for unconstrained optimization problems ⋮ On \(q\)-Newton's method for unconstrained multiobjective optimization problems ⋮ A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems ⋮ A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- Some variants of the controlled random search algorithm for global optimization
- Hybrid metaheuristics. An emerging approach to optimization.
- Variable neighborhood search
- Designing and reporting on computational experiments with heuristic methods
- The calculus of simplex gradients
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Principles of scatter search
- Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
- Tabu search directed by direct search methods for nonlinear global optimization
- Frank Hilton Jackson
- Introduction to Derivative-Free Optimization
- Testing Unconstrained Optimization Software
- Numerical Optimization
- A Method for q-Calculus
- Benchmarking Derivative-Free Optimization Algorithms
- The q-Gradient Vector for Unconstrained Continuous Optimization Problems
- Function minimization by conjugate gradients
- A Simplex Method for Function Minimization
- Quantum calculus
This page was built for publication: Global optimization using \(q\)-gradients