A New Spectral Conjugate Gradient method for solving unconstrained Optimization problems [PDF]
The spectral conjugate gradient methods are fascinating, and it has been shown that they are useful for strictly convex quadratic reduction when used properly.
أسامة محمد طاهر ویس +2 more
doaj +1 more source
Approach to development of algorithms of Newtonian methods of unconstrained optimization, their software implementation and benchmarking [PDF]
The approach to increase efficiency of Gill and Murray's algorithm of Newtonian methods of unconstrained optimization with step adjustment creation is offered, rests on Choleskys factorization.
Gennadiy Anatolievich Zelenkov +1 more
doaj +1 more source
Exploiting Hardware and Software Advances for Quadratic Models of Wind Farm Layout Optimization
A key aspect of the design of a wind farm is the wind farm layout optimization (WFLO) problem: given a wind farm site and information about the wind patterns, the problem is to decide the location of individual wind turbines to maximize energy production
Arik Senderovich +3 more
doaj +1 more source
Computational Complexity of Quadratic Unconstrained Binary Optimization
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
Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
The Fujitsu Digital Annealer is designed to solve fully connected quadratic unconstrained binary optimization (QUBO) problems. It is implemented on application-specific CMOS hardware and currently solves problems of up to 1,024 variables.
Maliheh Aramon +7 more
doaj +1 more source
A METHOD FOR SOLVING THE PROCUREMENT OPTIMIZATION PROBLEM BASED ON INVERSE CALCULATIONS [PDF]
The paper describes a method for solving the procurement optimization problem based on inverse calculations. The method involves solving the unconstrained optimization problem and adjusting the obtained values of arguments subject to the constraint ...
Ekaterina Gribanova
doaj +1 more source
Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization. This paper shows how to solve it on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem ...
Siddharth Jain
doaj +1 more source
Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C(2), C(3), C(4),….
Wang, Di, Kleinberg, Robert
openaire +2 more sources
Multi-Objective Optimization Technique Based on QUBO and an Ising Machine
With an increase in the complexity of society, solving multi-objective optimization problems (MOPs) has become crucial. In this study, we introduced a novel method called “quadratic unconstrained binary optimization based on the weighted normal ...
Hiroshi Ikeda, Takashi Yamazaki
doaj +1 more source
Power Network Optimization: A Quantum Approach
Optimization of electricity surplus is a crucial element for transmission power networks since it leads to reducing costs as well as increasing efficiency across the network as a whole.
Giuseppe Colucci +2 more
doaj +1 more source

