GloptiNets: Scalable Non-Convex Optimization with Certificates
From MaRDI portal
Publication:6441560
arXiv2306.14932MaRDI QIDQ6441560
Author name not available (Why is that?)
Publication date: 26 June 2023
Abstract: We present a novel approach to non-convex optimization with certificates, which handles smooth functions on the hypercube or on the torus. Unlike traditional methods that rely on algebraic properties, our algorithm exploits the regularity of the target function intrinsic in the decay of its Fourier spectrum. By defining a tractable family of models, we allow at the same time to obtain precise certificates and to leverage the advanced and powerful computational techniques developed to optimize neural networks. In this way the scalability of our approach is naturally enhanced by parallel computing with GPUs. Our approach, when applied to the case of polynomials of moderate dimensions but with thousands of coefficients, outperforms the state-of-the-art optimization methods with certificates, as the ones based on Lasserre's hierarchy, addressing problems intractable for the competitors.
Has companion code repository: https://github.com/gaspardbb/gloptinets.jl
This page was built for publication: GloptiNets: Scalable Non-Convex Optimization with Certificates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6441560)