A Descent Algorithm for Minimizing Polyhedral Convex Functions

1983 ◽  
Vol 4 (4) ◽  
pp. 757-786 ◽  
Author(s):  
D. I. Clark ◽  
M. R. Osborne
Keyword(s):  
Convex Functions ◽  
Descent Algorithm ◽  
Polyhedral Convex ◽  
Polyhedral Convex Functions

A finite algorithm for the rank regression problem

1982 ◽  
Vol 19 (A) ◽  
pp. 241-252
Author(s):  
M. R. Osborne
Keyword(s):  
Convex Functions ◽  
Numerical Results ◽  
Regression Problem ◽  
New Approach ◽  
Rank Regression ◽  
Polyhedral Convex ◽  
Polyhedral Convex Functions

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.

A finite algorithm for the rank regression problem

1982 ◽  
Vol 19 (A) ◽  
pp. 241-252 ◽  
Author(s):  
M. R. Osborne
Keyword(s):  
Convex Functions ◽  
Numerical Results ◽  
Regression Problem ◽  
New Approach ◽  
Rank Regression ◽  
Polyhedral Convex ◽  
Polyhedral Convex Functions

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.

Sign in / Sign up

Export Citation Format

Share Document