Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
The paper deals with the problem of finding sparse solutions to systems of polynomial equations possibly perturbed by noise. In particular, we show how these solutions can be recovered from group-sparse solutions of a derived system of linear equations. Then, two approaches are considered to find these group-sparse solutions. The first one is based on a convex relaxation resulting in a second-order cone programming formulation which can benefit from efficient reweighting techniques for sparsity enhancement. For this approach, sufficient conditions for the exact recovery of the sparsest solution to the polynomial system are derived in the noiseless setting, while stable recovery results are obtained for the noisy case. Though lacking a similar analysis, the second approach provides a more computationally efficient algorithm based on a greedy strategy adding the groups one-by-one. With respect to previous work, the proposed methods recover the sparsest solution in a very short computing time while remaining at least as accurate in terms of the probability of success. This probability is empirically analyzed to emphasize the relationship between the ability of the methods to solve the polynomial system and the sparsity of the solution.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Sparse Approximate Solutions to Max-Plus Equations with Application to Multivariate Convex Regression
In this work, we study the problem of finding approximate, with minimum support set, solutions to matrix max-plus equations, which we call sparse approximate solutions. We show how one can obtain such solutions efficient…
regressionSparse Solutions to Nonnegative Linear Systems and Applications
We give an efficient algorithm for finding sparse approximate solutions to linear systems of equations with nonnegative coefficients. Unlike most known results for sparse recovery, we do not require {\em any} assumption …
Solution of option pricing equations using orthogonal polynomial expansion
In this paper we study both analytic and numerical solutions of option pricing equations using systems of orthogonal polynomials. Using a Galerkin-based method, we solve the parabolic partial diferential equation for the…
Some bounds on positive equilibria in mass action networks
We present some results helpful for parameterising positive equilibria, and bounding the number of positive nondegenerate equilibria, in mass action networks. Any mass action network naturally gives rise to a set of poly…
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
We consider the problem of finding nearly optimal solutions of optimization problems with random objective functions. Two concrete problems we consider are (a) optimizing the Hamiltonian of a spherical or Ising $p$-spin …