Most optimization algorithms are based on quadratic approximations to nonlinear functions. You should try to avoid the use of funcions that cannot be properly approximated by quadratic functions. Try ...

1. Introduction Discrete optimization problems have ubiquitous applications in various fields and, in particular, many NP-hard combinatorial optimization problems can be mapped to a quadratic Ising ...

The standard quadratic optimization problem (StQP) refers to the problem of minimizing a quadratic form over the standard simplex. Such a problem arises from numerous applications and is known to be ...

Jöran Friberg, Geometric division problems, quadratic equations, and recursive geometric algorithms in Mesopotamian mathematics, Archive for History of Exact Sciences, Vol. 68, No. 1 (January 2014), ...

V6 is three to five times faster than V5, and can solve problems as large as n = 502 (502 qubits). Conclusions and future work This paper reports on the first experiments we know of to compare ...

Affiliations: [College of Resources Shandong, University of Science and Technology, Tai’an, China].

Affiliations: [College of Mathematics and Systems Science, Xinjiang University, Ürümqi, China, Institute of Mathematics and Physics, Xinjiang University, Ürümqi ...