2000 character limit reached
Optimization of Polynomials with Sparsity Encoded in a Few Linear Forms (2204.01319v1)
Published 4 Apr 2022 in math.OC
Abstract: We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of sparsity and also allows to provide an approximation of any polynomial by such sparse polynomials.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.