Results 1 to 10 of about 327 (65)
Goal seeking Quadratic Unconstrained Binary Optimization
The Quadratic Unconstrained Binary Optimization (QUBO) modeling and solution framework is a requirement for quantum and digital annealers. However optimality for QUBO problems of any practical size is extremely difficult to achieve.
Amit Verma, Mark Lewis
doaj +3 more sources
In this paper, we consider the inclusion of the solvency capital requirement (SCR) into portfolio optimization by the use of a quadratic proxy model. The Solvency II directive requires insurance companies to calculate their SCR based on the complete loss
Ivica Turkalj +8 more
doaj +3 more sources
Preconditioned conjugate gradient methods for absolute value equations
We investigate the NP-hard absolute value equations (AVE), \(Ax-B|x| =b\), where \(A,B\) are given symmetric matrices in \(\mathbb{R}^{n\times n}, \ b\in \mathbb{R}^{n}\).
Nassima Anane, Mohamed Achache
doaj +7 more sources
Smooth Twin Parametric Insensitive Support Vector Regression [PDF]
As one of the machine learning methods, twin parametric insensitive support vector regression (TPISVR) had a simple mathematical model and good learning performance.
HUANG Huajuan, WEI Xiuxi, ZHOU Yongquan
doaj +1 more source
On the hardness of quadratic unconstrained binary optimization problems
We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to close-by solutions.
V. Mehta +7 more
doaj +1 more source
Grover Adaptive Search for Constrained Polynomial Binary Optimization [PDF]
In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained Binary Optimization (QUBO) problems, as a special case.
Austin Gilliam +2 more
doaj +1 more source
Optimization of the power consumption mode of pumping stations of “Suv Okova” by reactive power [PDF]
The optimal modes of the existing compensating devices under operating conditions were determined. Minimum power and energy losses were taken as optimality criteria.
Muzafarov Shavkat +4 more
doaj +1 more source
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated.
Kensuke Tamura +4 more
doaj +1 more source
Quadratic Unconstrained Binary Optimization for the Automotive Paint Shop Problem
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 +1 more source
Parity Quantum Optimization: Compiler [PDF]
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

