A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and compute bounds on partial assignments asynchronously. The asynchronous bounds computation is based on the propagation of partial assignments. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps on...

Exploiting visual cues to control systems for robotic applications is a promising idea. Practically, they are usable only if the end result accedes to the restrictions of the specific environment. These restrictions are like the limited field of view of the camera and physical constraints of the workspace of the robot. Hence, there is a need for a general framework that can be used adaptively a...

Clifford A. Meyer and Christodoulos A. Floudas Department of Chemical Engineering, Princeton University, Princeton, NJ 08544, USA Abstract This paper presents an efficient branch and bound approach to address the global optimization of constrained optimization problems with twice differentiable functions. A lower bound on the global minimum is determined via a convex nonlinear programming probl...

Discrete-rate spectrum balancing in interference-limited multi-user and multi-carrier digital subscriber lines (DSL) is a large-scale, non-convex and combinatorial problem. Previously proposed algorithms for its (dual) optimal solution are only applicable for networks with few users, while the suboptimality of less complex bit-loading algorithms has not been adequately studied so far. We deploy...

In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

In blackbox optimization, evaluation of the objective and constraint functions is time consuming. some situations, values may be evaluated independently or sequentially. The present work proposes compares two strategies to define a hierarchical ordering constraints interrupt process at trial point when it detected that will not improve current best solution. Numerical experiments are performed ...

Performance characteristic of an Unmanned Air Vehicle (UAV) is investigated using a newly developed heuristic approach. Almost all flight phases of any air vehicle can be categorized into trim and maneuvering flights. In this paper, a new envelope called trim-ability envelope, is introduced and sketched within the conventional flight envelope for a small UAV. Optimal maneuverability of the inte...