Jump to ContentJump to Main Navigation
Numerical Methods for Nonlinear Estimating Equations$
Users without a subscription are not able to see the full content.

Christopher G. Small and Jinfang Wang

Print publication date: 2003

Print ISBN-13: 9780198506881

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198506881.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 17 December 2018

Introduction

Introduction

Chapter:
(p.1) 1 Introduction
Source:
Numerical Methods for Nonlinear Estimating Equations
Author(s):

Christopher G. Small

Jinfang Wang

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198506881.003.0001

The first part of this chapter provides some background information on the problem of nonlinearity arising in statistical inference. In particular, it discusses the problem of multiple roots and explains why the problem of multiple roots is complicated when using non-conservative estimating functions. The second part of the chapter gives a detailed introduction to each following chapter in the book.

Keywords:   artificial likelihood, consistency of MLE, efficiency of MLE, estimating equation, iterative algorithm, likelihood inference, multiple roots, Newton-Raphson method, non-conservative estimating equation, quasi-score

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .