Results 31 to 40 of about 108,734 (233)
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
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
Flight Gate Assignment with a Quantum Annealer [PDF]
, 2018 Optimal flight gate assignment is a highly relevant optimization problem from airport management. Among others, an important goal is the minimization of the total transit time of the passengers.
A Haghani +6 more
core +4 more sources
PLoS ONE, 2022 The most advanced D-Wave Advantage quantum annealer has 5000+ qubits, however, every qubit is connected to a small number of neighbors. As such, implementation of a fully-connected graph results in an order of magnitude reduction in qubit count.
A. Teplukhin +4 more
semanticscholar +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
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis [PDF]
Networks, 2017 The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a variety of disciplines that face these problems. A new class of quantum annealing computer that maps QUBO onto a physical qubit network structure with specific size and edge ...
Lewis, Mark, Glover, Fred
openaire +2 more sources
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
Variable Reduction For Quadratic Unconstrained Binary Optimization
, 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
Verma, Amit, Lewis, Mark
openaire +2 more sources
An Improved Adaptive Trust-Region Method for Unconstrained Optimization
Mathematical Modelling and Analysis, 2014 In this study, we propose a trust-region-based procedure to solve unconstrained optimization problems that take advantage of the nonmonotone technique to introduce an efficient adaptive radius strategy.
Hamid Esmaeili, Morteza Kimiaei
doaj +1 more source