Results 1 to 10 of about 43,808 (135)
Goal seeking Quadratic Unconstrained Binary Optimization
Results in Control and Optimization, 2022 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
RisksIn 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
Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing [PDF]
EntropyFlexible job-shop scheduling problems (FJSPs) represent one of the most complex combinatorial optimization challenges. Modern production systems and control processes demand rapid decision-making in scheduling.
Kaihan Fu +3 more
doaj +2 more sources
Preconditioned conjugate gradient methods for absolute value equations
Journal of Numerical Analysis and Approximation Theory, 2020 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
On the hardness of quadratic unconstrained binary optimization problems
Frontiers in Physics, 2022 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
Two Modified QN-Algorithms for Solving Unconstrained Optimization Problems [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2013 This paper presents two modified Quasi-Newton algorithms which are designed for solving nonlinear unconstrained optimization problems. These algorithms are based on different techniques namely: Quasi-Newton conditions on quadratic and non-quadratic ...
Abbas Al-Bayati, Basim Hassan
doaj +1 more source
Grover Adaptive Search for Constrained Polynomial Binary Optimization [PDF]
Quantum, 2021 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
New Secant Hyperbolic Model for Conjugate Gradient Method [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2008 New hyperbolic model different from the quadratic ones is proposed for solving unconstrained optimization problems which modify the classical conjugate gradient method.
Abbas Al-Bayati, Ban Mitras
doaj +1 more source
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
IEEE Access, 2021 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
Optimization of the power consumption mode of pumping stations of “Suv Okova” by reactive power [PDF]
E3S Web of Conferences, 2021 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