Results 11 to 20 of about 43,906 (221)
Quadratic Unconstrained Binary Optimization for the Automotive Paint Shop Problem
IEEE Access, 2023 The Binary Paint Shop Problem (BPSP) is a combinatorial optimization problem which draws inspiration from the automotive paint shop. Its binary nature, making it a good fit for Quadratic Unconstrained Binary Optimization (QUBO) solvers, has been well ...
Pieter Debevere +2 more
doaj +2 more sources
Variable Reduction For Quadratic Unconstrained Binary Optimization
CoRR, 2021 Quadratic Unconstrained Binary Optimization models are useful for solving a diverse range of optimization problems. Constraints can be added by incorporating quadratic penalty terms into the objective, often with the introduction of slack variables needed for conversion of inequalities. This transformation can lead to a significant increase in the size
Amit Verma, Mark W. Lewis
openaire +2 more sources
A robustification approach in unconstrained quadratic optimization [PDF]
Mathematical Programming, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin K. Bernauer, Roland Griesse
openaire +2 more sources
Computational Complexity of Quadratic Unconstrained Binary Optimization
CoRR, 2021 In this paper, we study the computational complexity of the quadratic unconstrained binary optimization (QUBO) problem under the functional problem FP^NP categorization. We focus on four sub-classes: (1) When all coefficients are integers QUBO is FP^NP-complete.
openaire +2 more sources
Parity Quantum Optimization: Compiler [PDF]
Quantum, 2023 We introduce parity quantum optimization with the aim of solving optimization problems consisting of arbitrary $k$-body interactions and side conditions using planar quantum chip architectures.
Kilian Ender +4 more
doaj +1 more source
A New Non Quadratic Model For Unconstrained Non Linear Optimization [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2004 A new non-quadratic model is proposed for solving unconstrained optimization problems, which modifies and develops the classical conjugate gradient methods.
Basim Hassan, Nidhal Al-Assady
doaj +1 more source
A New hybrid generalized CG- method for non-linear functions [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2010 In this paper a new extended generalized conjugate gradient algorithm is proposed for unconstrained optimization, which is considered as anew inverse hyperbolic model .In order to improve the rate of convergence of the new technique, a new hybrid ...
Abbas Al-Bayati, Hamsa Chilmerane
doaj +1 more source
UOBYQA: unconstrained optimization by quadratic approximation [PDF]
Mathematical Programming, 2002 A new algorithm for general unconstrained optimization calculations is described. It takes account of the curvature of the objective function by forming quadratic models by interpolation. Obviously, no first derivatives are required. A typical iteration of the algorithm generates a new vector of variables either by minimizing the quadratic model ...
openaire +1 more source
HUBO formulations for solving the eigenvalue problem
Results in Control and Optimization, 2023 Solving the eigenvalue problem is particularly important in almost all fields of science and engineering. With the development of quantum computers, multiple algorithms have been proposed for this purpose.
Kyungtaek Jun, Hyunju Lee
doaj +1 more source
On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods [PDF]
, 2012 International audienceThis article presents a family of semidefinite programming bounds, obtained by Lagrangian duality, for 0-1 quadratic optimization problems with linear or quadratic constraints. These bounds have useful computational properties: they
Malick, Jérôme, Roupin, Frédéric
core +5 more sources