Isotone Optimization in R: Pool-Adjacent-Violators Algorithm (PAVA) and Active Set Methods
By: Researcher
Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).
| Authors | Jan de Leeuw, Kurt Hornik, Patrick Mair |
| Journal/Conference Name | JOURNAL OF STATISTICAL SOFTWARE |
| Paper Category | Other |
| Paper Abstract | In this paper we give a general framework for isotone optimization. First we discuss a generalized version of the pool-adjacent-violators algorithm (PAVA) to minimize a separable convex function with simple chain constraints. Besides of general convex functions we extend existing PAVA implementations in terms of observation weights, approaches for tie handling, and responses from repeated measurement designs. Since isotone optimization problems can be formulated as convex programming problems with linear constraints we the develop a primal active set method to solve such problem. This methodology is applied on specific loss functions relevant in statistics. Both approaches are implemented in the R package isotone. |
| Date of publication | 2009 |
| Code Programming Language | R |
| Comment |
Copyright Researcher 2022