Abstract
This note deals with the article ‘On iterative procedures of asymptotic inference’ by K.O. DZHAPARIDZE (1983), in which an informal discussion is given on performing an unconstrained maximization or solving non–linear equations of statistics by iterative methods with the quadratic termination property. It discusses the theorem that if a maximized function, e.g. the likelihood function, is asymptotically quadratic, then for asymptotically efficient inference finitely many iterations are needed.It is argued here that the theory still applies if certain well specified inexact (hence computationally cheaper) line searches are used in the optimization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
