z-logo
open-access-imgOpen Access
Isotone Optimization inR: Pool-Adjacent-Violators Algorithm (PAVA) and Active Set Methods
Author(s) -
Jan de Leeuw,
Kurt Hornik,
Patrick Mair
Publication year - 2009
Publication title -
journal of statistical software
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 7.636
H-Index - 145
ISSN - 1548-7660
DOI - 10.18637/jss.v032.i05
Subject(s) - mathematical optimization , set (abstract data type) , separable space , computer science , linear programming , regular polygon , algorithm , function (biology) , convex function , simple (philosophy) , convex optimization , mathematics , programming language , mathematical analysis , philosophy , geometry , epistemology , evolutionary biology , biology
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 then develop a primal active set method to solve such problem. This methodology is applied on specic loss functions relevant in statistics. Both approaches are implemented in the R package isotone.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom