A finite algorithm for the rank regression problem
1982 ◽
Vol 19
(A)
◽
pp. 241-252
◽
Keyword(s):
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.
2000 ◽
Vol 25
(4)
◽
pp. 352-427
◽
1983 ◽
Vol 4
(4)
◽
pp. 757-786
◽
2015 ◽
Vol 171
(2)
◽
pp. 617-642
◽
2021 ◽
Vol 36
(3)
◽
pp. 165-176
Keyword(s):
1993 ◽
Vol 115
(1)
◽
pp. 70-74
◽
Keyword(s):