Introduces the constrained multiplier criterion for misspecification-averse estimation and proves its asymptotic optimality via a local minimax theorem in a limit experiment incorporating moment constraints.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
verdicts
UNVERDICTED 2representative citing papers
Proposes APUB optimization framework for stochastic programming, proves asymptotic correctness and consistency of the new bound, and develops bootstrap and L-shaped solvers for two-stage linear problems with empirical tests on a product mix example.
citing papers explorer
-
Misspecification-Averse Estimation
Introduces the constrained multiplier criterion for misspecification-averse estimation and proves its asymptotic optimality via a local minimax theorem in a limit experiment incorporating moment constraints.
-
Minimizing Upper Confidence Bounds: A Data-Driven Framework for Stochastic Programming
Proposes APUB optimization framework for stochastic programming, proves asymptotic correctness and consistency of the new bound, and develops bootstrap and L-shaped solvers for two-stage linear problems with empirical tests on a product mix example.