Inverse Optimization with Noisy Data
Top Cited Papers
- 1 June 2018
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 66 (3) , 870-892
Abstract
Inverse optimization refers to the inference of unknown parameters of an optimization problem based on knowledge of its optimal solutions. This paper considers inverse optimization in the setting where measurements of the optimal solutions of a convex optimization problem are corrupted by noise. We first provide a formulation for inverse optimization and prove it to be NP-hard. In contrast to existing methods, we show that the parameter estimates produced by our formulation are statistically consistent. Our approach involves combining a new duality-based reformulation for bilevel programs with a regularization scheme that smooths discontinuities in the formulation. Using epi-convergence theory, we show the regularization parameter can be adjusted to approximate the original inverse optimization problem to arbitrary accuracy, which we use to prove our consistency results. Next, we propose two solution algorithms based on our duality-based formulation. The first is an enumeration algorithm that is applicable to settings where the dimensionality of the parameter space is modest, and the second is a semiparametric approach that combines nonparametric statistics with a modified version of our formulation. These numerical algorithms are shown to maintain the statistical consistency of the underlying formulation. Finally, using both synthetic and real data, we demonstrate that our approach performs competitively when compared with existing heuristics.Keywords
All Related Versions
This publication has 46 references indexed in Scilit:
- Inverse optimization for linearly constrained convex separable programming problemsEuropean Journal of Operational Research, 2010
- Demand response modeling considering Interruptible/Curtailable loads and capacity market programsApplied Energy, 2010
- Estimating Dynamic Models of Imperfect CompetitionEconometrica, 2007
- Inverse conic programming with applicationsOperations Research Letters, 2005
- Persistence in high-dimensional linear predictor selection and the virtue of overparametrizationBernoulli, 2004
- Calculating some inverse linear programming problemsJournal of Computational and Applied Mathematics, 1996
- A Representation and Economic Interpretation of a Two-Level Programming ProblemJournal of the Operational Research Society, 1981
- The Framing of Decisions and the Psychology of ChoiceScience, 1981
- Asymptotic Properties of Non-Linear Least Squares EstimatorsThe Annals of Mathematical Statistics, 1969
- Note on the Consistency of the Maximum Likelihood EstimateThe Annals of Mathematical Statistics, 1949