2011
DOI: 10.1007/978-1-4614-0769-0_14
|View full text |Cite
|
Sign up to set email alerts
|

Positivity and Optimization: Beyond Polynomials

Abstract: We briefly recall basics of the Moment-SOS hierarchy in polynomial optimization and the Christoffel-Darboux kernel (and the Christoffel function (CF)) in theory of approximation and orthogonal polynomials. We then (i) show a strong link between the CF and the SOS-based positive certificate at the core of the Moment-SOS hierarchy, and (ii) describe how the CDkernel provides a simple interpretation of the SOS-hierarchy of lower bounds as searching for some signed polynomial density (while the SOS-hierarchy of up… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

1
2
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 46 publications
1
2
0
Order By: Relevance
“…Namely, several equivalent formulations of the so-called Unitary Extension Principle (UEP) from [33] are interpreted in terms of hermitian sums of squares of certain nonnegative trigonometric polynomials and in terms of semi-definite programming. The latter together with the results in [31,35] answer affirmatively the long standing open question of the existence of such tight wavelet frames in dimension d = 2; we also provide numerically efficient methods for checking their existence and actual construction in any dimension. We exhibit a class of counterexamples in dimension d = 3 showing that, in general, the UEP property is not sufficient for the existence of tight wavelet frames.…”
supporting
confidence: 75%
See 2 more Smart Citations
“…Namely, several equivalent formulations of the so-called Unitary Extension Principle (UEP) from [33] are interpreted in terms of hermitian sums of squares of certain nonnegative trigonometric polynomials and in terms of semi-definite programming. The latter together with the results in [31,35] answer affirmatively the long standing open question of the existence of such tight wavelet frames in dimension d = 2; we also provide numerically efficient methods for checking their existence and actual construction in any dimension. We exhibit a class of counterexamples in dimension d = 3 showing that, in general, the UEP property is not sufficient for the existence of tight wavelet frames.…”
supporting
confidence: 75%
“…Namely, in subsection 3.3, we show how to reformulate Theorem 3.10 equivalently as a problem of semidefinite programming. This establishes a connection between constructions of tight wavelet frames and moment problems, see [24,30,31] for details.…”
Section: Introductionmentioning
confidence: 87%
See 1 more Smart Citation