Name
Abstract | ||
|---|---|---|
A relaxation method based on border basis reduction which improves the efficiency of Lasserre's approach is proposed to compute the infimum of a polynomial function on a basic closed semi-algebraic set. A new stopping criterion is given to detect when the relaxation sequence reaches the infimum, using a sparse flat extension criterion. We also provide a new algorithm to reconstruct a finite sum of weighted Dirac measures from a truncated sequence of moments, which can be applied to other sparse reconstruction problems. As an application, we obtain a new algorithm to compute zero-dimensional minimizer ideals and the minimizer points or zero-dimensional G-radical ideals. Experiments show the impact of this new method on significant benchmarks. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.jsc.2015.08.004 | Journal of Symbolic Computation |
Keywords | Field | DocType |
sdp | Discrete mathematics,Polynomial optimization,Combinatorics,Polynomial,Relaxation (iterative method),Infimum and supremum,Dirac (video compression format),Mathematics | Journal |
Volume | Issue | ISSN |
74 | C | 0747-7171 |
Citations | PageRank | References |
3 | 0.41 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| marta abril bucero | 1 | 3 | 0.41 |
| Bernard Mourrain | 2 | 1074 | 113.70 |