.png){kind=icon}
.png){kind=icon}
Return
Computing moment inequality models using constrained optimization
.png){kind=icon}
OA
AI
DOI：10.1093/ectj/utab014.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Inference for moment inequality models is computationally demanding and often involves time-consuming grid search. By exploiting the equivalent formulations between unconstrained and constrained optimization, we establish new ways to compute the identified set and its confidence set in moment inequality models that overcome some of these computational hurdles. In simulations, using both linear and nonlinear moment inequality models, we show that our method significantly improves the solution quality and save considerable computing resources relative to conventional grid search. Our methods are user-friendly and can be implemented using a variety of canned software packages.
Keywords:
Moment inequality
constrained optimization
MPEC
MPCC
partial identification
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
565
Citations:
2.3K