Enhancing the Convergence Properties of the BLP (1995) Contraction Mapping
In the wake of Dub´e, Fox and Su (2012), this paper (i) analyzes the consequences for the BLP Contraction Mapping (Berry, Levinsohn and Pakes, 1995) of setting the inner-loop convergence tolerance at the required level of in D 10 14 to avoid propagation of approximation error from inner to outer loop, and (ii) proposes acceleration as a viable alternative within the confines of the Nested-Fixed Point paradigm (Rust, 1987) to enhance the convergence properties of the inner-loop BLP Contraction Mapping. Drawing upon the equivalence between nonlinear rootfinding and fixed-point iter- ation, we introduce and compare two alternative methods specifically designed for handling large-scale nonlinear problems, in particular the derivative-free spectral al- gorithm for nonlinear equations (La Cruz et al., 2006, DF-SANE), and the squared polynomial extrapolation method for fixed-point acceleration (Varadhan and Roland, 2008, SQUAREM). Running a Monte Carlo study with specific scenarios and with Newton-Raphson as a benchmark, we study the characteristics of these algorithms in terms of (i) speed, (ii) robustness, and (iii) quality of approximation. Under the worst of circumstances we find that (i) SQUAREM is faster (up to more than five times as fast) and more robust (up to 14 percentage points better suc- cess rate) than BLP while attaining a comparable quality of approximation, and (ii) also outperforms DF-SANE in nearly all scenarios. Eliminating averaging bias against more robust algorithms, a performance profile subsequently shows that (iii) SQUAREM is both faster, delivers the best quality approximation, and is more robust than BLP, DF-SANE and Newton-Raphson.
|Date of creation:||2012|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +32 (0) 16 / 32 6661
Web page: http://www.econ.kuleuven.be/vivesEmail:
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ete:vivwps:35. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Damiaan Persyn)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.