A new hybrid classical-quantum algorithm for continuous global optimization problems
From MaRDI portal
Publication:486403
DOI10.1007/s10898-013-0112-8zbMath1312.90061arXiv1301.4667OpenAlexW2013974539WikidataQ62562151 ScholiaQ62562151MaRDI QIDQ486403
Pedro C. S. Lara, Renato Portugal, Carlile C. Lavor
Publication date: 15 January 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.4667
Related Items
Trajectory optimization using quantum computing, A quantum approach to the discretizable molecular distance geometry problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid method for quantum global optimization
- A review of recent advances in global optimization
- On the limited memory BFGS method for large scale optimization
- Combining a local search and Grover's algorithm in black-box global optimization
- Using modifications to Grover's search algorithm for quantum global optimization
- A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
- Truncated-Newton algorithms for large-scale unconstrained optimization
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM
- Improving ultimate convergence of an augmented Lagrangian method
- Updating Quasi-Newton Matrices with Limited Storage
- Strengths and Weaknesses of Quantum Computing
- Grover's Quantum Algorithm Applied to Global Optimization
- A Simplex Method for Function Minimization
- On uniform covering, adaptive random search and raspberries
- Solving a class of continuous global optimization problems using quantum algorithms
