Related Experiment Video
Updated: Jan 27, 2026

Conditions Affecting Social Space in Drosophila melanogaster
Published on: November 5, 2015
Global optimization in Hilbert space
Boris Houska1, Benoît Chachuat2
11School of Information Science and Technology, ShanghaiTech University, 319 Yueyang Road, Shanghai, 200031 China.
Abstract:
We propose a complete-search algorithm for solving a class of non-convex, possibly infinite-dimensional, optimization problems to global optimality. We assume that the optimization variables are in a bounded subset of a Hilbert space, and we determine worst-case run-time bounds for the algorithm under certain regularity conditions of the cost functional and the constraint set. Because these run-time bounds are independent of the number of optimization variables and, in particular, are valid for optimization problems with infinitely many optimization variables, we prove that the algorithm converges to an -suboptimal global solution within finite run-time for any given termination tolerance . Finally, we illustrate these results for a problem of calculus of variations.
Related Concept Videos
Global Climate Change
State Space Representation
Consider an RLC circuit, a...
Space Trusses
At the core of a space truss lies the fundamental unit known as the tetrahedron. This structure is composed of six members that form a three-dimensional shape...
Transfer Function to State Space
In an RLC...
State Space to Transfer Function
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
Space Trusses: Problem Solving
Consider a tripod consisting of a tetrahedral space truss with a ball-and-socket joint at C. Suppose the height and lengths of the horizontal and vertical...

