Article contents
A finite algorithm for the rank regression problem
Published online by Cambridge University Press: 14 July 2016
Abstract
A new approach to the minimization of polyhedral convex functions is applied to give a finite algorithm for the rank regression problem. Numerical results for the Daniel and Wood example are presented.
Keywords
- Type
- Part 5 — Statistical Theory
- Information
- Copyright
- Copyright © 1982 Applied Probability Trust
References
- 2
- Cited by