A copositive framework for analysis of hybrid Ising-classical algorithms

DOI10.1137/22M1514581MaRDI QIDQ6495776zbMATH OpenFDO

Authors Robin Brown, David E. Bernal Neira, Davide Venturelli, Marco Pavone

Publication date 2 May 2024

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/22M1514581

zbMATH Keywords

copositive optimizationcutting-planeIsing solversmixed-binary quadratic programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Quadratic programming (90C20) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Quantum annealing learning search for solving QUBO problems
• A universal quantum algorithm for weighted maximum cut and Ising problems
• A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
• A study of the performance of classical minimizers in the quantum approximate optimization algorithm
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models

Cites work

• A cutting plane algorithm for convex programming that uses analytic centers
• A general system for heuristic minimization of convex functions over non-convex sets
• A variational approach to copositive matrices
• An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
• Approximating the centroid is hard
• Approximation of the stability number of a graph via copositive programming
• Benchmarking the quantum approximate optimization algorithm
• Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convex optimization theory.
• Copositive programming
• Copositivity tests based on the linear complementarity problem
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Global convergence of ADMM in nonconvex nonsmooth optimization
• Global optimization with polynomials and the problem of moments
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
• scientific article; zbMATH DE number 3508265 (Why is no real title available?)
• scientific article; zbMATH DE number 4123531 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 6135091 (Why is no real title available?)
• scientific article; zbMATH DE number 3248677 (Why is no real title available?)
• On barren plateaus and cost function locality in variational quantum algorithms
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Polynomial algorithms in linear programming
• Practical integer-to-binary mapping for quantum annealers
• Solving convex programs by random walks
• Some NP-complete problems in quadratic and nonlinear programming
• Tabu search and finite convergence
• Testing copositivity via mixed-integer linear programming
• Testing copositivity with the help of difference-of-convex optimization
• The theory of variational hybrid quantum-classical algorithms

This page was built for publication: A copositive framework for analysis of hybrid Ising-classical algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495776)