1. Global optimization in Hilbert space
- Author
-
Benoît Chachuat, Boris Houska, Engineering & Physical Science Research Council (EPSRC), and Commission of the European Communities
- Subjects
Technology ,Optimization problem ,Mathematics, Applied ,0211 other engineering and technologies ,CONVEX COMPUTATION ,010103 numerical & computational mathematics ,02 engineering and technology ,ELLIPSOIDS ,01 natural sciences ,90C26 ,93B40 ,Convergence analysis ,0102 Applied Mathematics ,Branch-and-lift ,CUT ,Mathematics ,65K10 ,021103 operations research ,Full Length Paper ,Operations Research & Management Science ,0103 Numerical and Computational Mathematics ,Bounded function ,Physical Sciences ,symbols ,49M30 ,Calculus of variations ,INTEGRATION ,SET ,Complexity analysis ,Complete search ,Operations Research ,General Mathematics ,APPROXIMATIONS ,Set (abstract data type) ,symbols.namesake ,Applied mathematics ,ALGORITHM ,0101 mathematics ,INTERSECTION ,Global optimization ,0802 Computation Theory and Mathematics ,Science & Technology ,Infinite-dimensional optimization ,Hilbert space ,Computer Science, Software Engineering ,Constraint (information theory) ,Computer Science ,Software - 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 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}ε-suboptimal global solution within finite run-time for any given termination tolerance \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon > 0$$\end{document}ε>0. Finally, we illustrate these results for a problem of calculus of variations.
- Published
- 2017