Abstract:In large-scale data-driven optimization problems, parameters are often only known approximately due to noisy and small-sized samples. We consider optimization problems with linear constraints where the true parameter matrix is not precisely known, and the number of constraints and variables are comparable and large. Our goal is to construct a linear estimator of the true parameter matrix by minimizing the Frobenius distance between the estimator and the true parameter matrix. Our method offers three key advantages: 1) the coefficients of the linear estimator are consistently estimated from the observations and require no further calibration; 2) it only requires the sample size to be greater than one and it delivers stable performance across varied sample sizes; and 3) the constraints of the formulated optimization problem using the estimator remain linear, ensuring computational efficiency when the number of constraints and variables are large. Simulation shows that our linear estimator consistently produces stable outcomes in terms of the objective value, the ratio of violated constraints and the magnitude of constraint violation across various scenarios, compared to the nominal and robust methods. Additionally, it demonstrates resilience against high levels of noise, making it a robust choice under uncertainty.
From: Naqi Huang [view email]
[v1]
Wed, 28 Feb 2024 19:21:38 UTC (1,719 KB)
[v2]
Tue, 8 Sep 2026 11:17:59 UTC (3,211 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。