Bounded optimization without prior knowledge of bounds

A sophisticated strategy roughly similar to the one you mention (but with mechanisms that provide certain convergence guarantees) is implemented in NOMAD.jl.

A model can be used to construct at each iteration that may suggest new promising iterates faster than the standard search strategy.