Skip Navigation

Biometrika 1983 70(2):490-491; doi:10.1093/biomet/70.2.490
© 1983 by Biometrika Trust
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by MURRAY, G. D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

MISCELLANEA

Nonconvergence of the minimax order algorithm

GORDON D. MURRAY

Department of Statistics, University of Glasgow Glasgow

The minimax order algorithm, an algorithm for fitting isotonic regressions, does not necessarily converge. A counterexample is given where the algorithm loops indefinitely.

Key Words: Isotonic regression • Minimax order algorithm • Partial order


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.