Global optimization using random embeddings

Journal article

We propose a random-subspace algorithmic framework for global optimization of Lipschitz-continuous objectives, and analyse its convergence using novel tools from conic integral geometry. X-REGO randomly projects, in a sequential or simultaneous manner, the high-dimensional original problem into low-dimensional subproblems that can then be solved with any global, or even local, optimization solver. We estimate the probability that the randomly-embedded subproblem shares (approximately) the same global optimum as the original problem. This success probability is then used to show almost sure convergence of X-REGO to an approximate global solution of the original problem, under weak assumptions on the problem (having a strictly feasible global solution) and on the solver (guaranteed to find an approximate global solution of the reduced problem with sufficiently high probability). In the particular case of unconstrained objectives with low effective dimension, we propose an X-REGO variant that explores random subspaces of increasing dimension until finding the effective dimension of the problem, leading to X-REGO globally converging after a finite number of embeddings, proportional to the effective dimension. We show numerically that this variant efficiently finds both the effective dimension and an approximate global minimizer of the original problem.

Authors: Cartis, C; Massart, E; Otemissov, A

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Springer
• Journal: Mathematical Programming
• Volume: 200
• Issue: 2
• Pages: 781-829
• Publication date: 2022-09-14
• Acceptance date: 2022-07-12
• DOI: 10.1007/s10107-022-01871-y
• EISSN: 1436-4646
• ISSN: 0025-5610
• Language: English
• Keywords: functions with low effective dimensionality; global optimization; dimensionality reduction techniques; conic integral geometry; random subspaces; FFR