Global optimization using random embeddings
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-...
Main Authors: | Cartis, C, Massart, E, Otemissov, A |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Springer
2022
|
Similar Items
-
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings
by: Cartis, C, et al.
Published: (2022) -
A dimensionality reduction technique for unconstrained global optimization of functions with low effective dimensionality
by: Cartis, C, et al.
Published: (2021) -
Dimensionality reduction techniques for global optimization
by: Otemissov, A
Published: (2020) -
Hashing embeddings of optimal dimension, with applications to linear least squares
by: Cartis, C, et al.
Published: (2021) -
Global rates of convergence for nonconvex optimization on manifolds
by: Boumal, N, et al.
Published: (2018)