2010
DOI: 10.1137/090759240
|View full text |Cite
|
Sign up to set email alerts
|

A “Joint+Marginal” Approach to Parametric Polynomial Optimization

Abstract: Abstract. Given a compact parameter set Y ⊂ R p , we consider polynomial optimization problems (Py) on R n whose description depends on the parameter y ∈ Y. We assume that one can compute all moments of some probability measure ϕ on Y, absolutely continuous with respect to the Lebesgue measure (e.g. Y is a box or a simplex and ϕ is uniformly distributed). We then provide a hierarchy of semidefinite relaxations whose associated sequence of optimal solutions converges to the moment vector of a probability measur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
54
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 32 publications
(54 citation statements)
references
References 27 publications
0
54
0
Order By: Relevance
“…This imposes the moments of ϕ on µ such that the optimal value of this SDP relaxation approximates E ϕ (ρ(Q heat )) from below [19].…”
Section: Numerical Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…This imposes the moments of ϕ on µ such that the optimal value of this SDP relaxation approximates E ϕ (ρ(Q heat )) from below [19].…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Using the polynomial representation outlined above, we cast the selection of an optimal set-point as a polynomial two-stage stochastic program with recourse [18]. We develop an approximation of polynomial two-stage problems based on semi-definite relaxations inspired by [19]. Using duality arguments, we derive a Generalized Moment Problem (GMP) that is equivalent to the two-stage problem and provide a sparse hierarchy of semidefinite programming (SDP) relaxations, which returns an estimate of the optimal setpoint and an expected cost estimate.…”
Section: Summary Of Contributionsmentioning
confidence: 99%
See 2 more Smart Citations
“…Rather than solving this two-stage problem, we approximate the linearization point using SDP relaxations of a GMP inspired by [13]. Specifically, we use the first moment, an output of the SDP relaxation, as a linearization point, and show that it minimizes the model discrepancy defined above.…”
Section: Introductionmentioning
confidence: 99%