2017
DOI: 10.1016/j.compchemeng.2017.07.004
|View full text |Cite
|
Sign up to set email alerts
|

Data-driven robust optimization based on kernel learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
68
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7
1

Relationship

5
3

Authors

Journals

citations
Cited by 176 publications
(68 citation statements)
references
References 38 publications
0
68
0
Order By: Relevance
“…and the ADF policy are adopted in the optimal control problem (12). Here different budget parameters Ω are used in the uncertainty set (48), that is, Ω ∈ {0, 0.01, 0.05, 0.1, 0.25, 0.5, 1, 1.5, 2}, thereby giving rise to a variety of tradeoffs between efficiency and robustness.…”
Section: Resultsmentioning
confidence: 99%
“…and the ADF policy are adopted in the optimal control problem (12). Here different budget parameters Ω are used in the uncertainty set (48), that is, Ω ∈ {0, 0.01, 0.05, 0.1, 0.25, 0.5, 1, 1.5, 2}, thereby giving rise to a variety of tradeoffs between efficiency and robustness.…”
Section: Resultsmentioning
confidence: 99%
“…To account for asymmetric distributions, forward and backward deviation vectors were utilized in the uncertainty set, which was further integrated with robust optimization models. A data-driven static robust optimization framework based on support vector clustering that aims to find the hypersphere with minimal volume to enclose uncertainty data was proposed [157]. The adopted piecewise linear kernel incorporates the covariance information, thus effectively capturing the correlation among uncertainties.…”
Section: Data-driven Robust Optimizationmentioning
confidence: 99%
“…We first introduce an efficient approach to data-based construction of W t (D), which is proposed by [25]. From a machine learning perspective, estimating the high-density…”
Section: Uncertainty Set Learning With Support Vector Clusteringmentioning
confidence: 99%
“…where matrix Q and the scalar L are kernel parameters that can be determined from data. Typically one can set Q as the sphering matrix Q Σ − 1 2 where Σ is the covariance matrix of w, and value of L shall be sufficiently large [25] 3 . By substituting (25) into (22), we can arrive at the following data-driven uncertainty set:…”
Section: Uncertainty Set Learning With Support Vector Clusteringmentioning
confidence: 99%
See 1 more Smart Citation