Results 51 to 60 of about 108,734 (233)

Computationally Efficient Trajectory Optimization for Linear Control Systems with Input and State Constraints

, 2012
This paper presents a trajectory generation method that optimizes a quadratic cost functional with respect to linear system dynamics and to linear input and state constraints.
Kennel, Ralph, Stumper, Jean-Francois
core   +1 more source

Computational Complexity of Quadratic Unconstrained Binary Optimization

, 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

A METHOD FOR SOLVING THE PROCUREMENT OPTIMIZATION PROBLEM BASED ON INVERSE CALCULATIONS [PDF]

Proceedings on Engineering Sciences, 2020
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

On limited-memory quasi-Newton methods for minimizing a quadratic function

, 2018
The main focus in this paper is exact linesearch methods for minimizing a quadratic function whose Hessian is positive definite. We give two classes of limited-memory quasi-Newton Hessian approximations that generate search directions parallel to those ...
Ek, David, Forsgren, Anders
core   +1 more source

Modifications of the Limited Memory BFGS Algorithm for Large-scale Nonlinear Optimization [PDF]

, 2005
In this paper we present two new numerical methods for unconstrained large-scale optimization. These methods apply update formulae, which are derived by considering different techniques of approximating the objective function.
Hassan, Malik Abu, June, Leong Wah
core   +1 more source

Solving the Traveling Salesman Problem on the D-Wave Quantum Computer

Frontiers in Physics, 2021
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

Conditions for State and Control Constraint Activation in Coordination of Connected and Automated Vehicles

, 2020
Connected and automated vehicles (CAVs) provide the most intriguing opportunity to reduce pollution, energy consumption, and travel delays. In earlier work, we addressed the optimal coordination of CAVs using Hamiltonian analysis.
Mahbub, A M Ishtiaque, Malikopoulos, Andreas A.   +1 more
core   +1 more source

Analyzing quadratic unconstrained binary optimization problems via multicommodity flows

Discrete Applied Mathematics, 2009
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

IEEE Access
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

IEEE Access, 2023
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, Stan van der Linde, Frank Phillipson   +2 more
doaj   +1 more source