Abstract
Given a finite partially-ordered set with a positive weighting function defined on its points, it is well known that any real-valued function defined on the set has a unique best order-preserving approximation in the weighted least squares sense. Many algorithms have been given for the solution of this isotonic regression problem. Most such algorithms either are not polynomial or they are of unknown time complexity. Recently, it has become clear that the general isotonic regression problem can be solved as a network flow problem in time O(n4) with a space requirement of O(n2), where n is the number of points in the set. Building on the insights at the basis of this improvement, we show here that, in the case of a general two-dimensional partial ordering, the problem can be solved in O(n3) time and, when the two-dimensional set is restricted to a grid, the time can be further improved to O(n2).
Similar content being viewed by others
References
Qian, S., Generalization of Least-Square Isotonic Regression, Journal of Statistical Planning and Inference, Vol. 38, pp. 389–397, 1994.
Robertson, T., Wright, F. T., and Dykstra, R.L. Order-Restricted Statistical Inference, John Wiley and Sons, New York, NY, 1988.
Sager, T.W., An Application of Isotonic Regression to Multivariate Density Estimation, Advances in Order-Restricted Statistical Inference, Edited by T. Robertson, F. T. Wright, and R. L. Dykstra, Springer Verlag, Berlin, Germany, pp. 69–90, 1986.
Barlow, R. E., Bartholomew, D. J., Bremner, J. M., and Brunk, H.D., Statistical Inference under Order Restrictions: The Theory and Application of Isotonic Regression, John Wiley and Sons, New York, NY, 1972.
Pardalos, P. M., and Xue, G., Algorithms for a Class of Isotonic Regression Problems, Algorithmica, Vol. 23, pp. 211–222, 1999.
Pardalos, P.M., Xue, G. L., and Yong, L., Efficient Computation of an Isotonic Median Regression, Applied Mathematics Letters, Vol. 8, pp. 67–70, 1995.
Best, M. J., and Chakravarti, N., Active Set Algorithms for Isotonic Regression: A Unifying Framework, Mathematical Programming, Vol. 47, pp. 425–439, 1990.
Maxwell, W. L., and Muckstadt, J.A., Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems, Operations Research, Vol. 33, pp. 1316–1341, 1985.
Block, H., Qian, S., and Sampson, A., Structure Algorithms for Partially-Ordered Isotonic Regression, Journal of Computational and Graphical Statistics, Vol. 3, pp. 285–300, 1994.
Van Lint, J. H., and Wilson, R.M., A Course in Combinatorics, Cambridge University Press, Cambridge, England, 1992.
Farley, A. M., and Proskurowski, A., Directed Maximal-Cut Problems, Information Processing Letters, Vol. 15, pp. 238–241, 1982.
Picard, J.C., Maximal Closure of a Graph and Applications to Combinatorial Problems, Management Science, Vol. 22, pp. 1268–1272, 1976.
Galil, Z., and Naamad, A., An O(EV log2V) Algorithm for the Maximal Flow Problem, Journal of Computer and System Sciences, Vol. 21, pp. 203–217, 1980.
Ayer, M., Brunk, H. D., Ewing, G.M., Reid, W. T., and Silverman, E., An Empirical Distribution Function for Sampling with Incomplete Information, Annals of Mathematical Statistics, Vol. 26, pp. 641–647, 1954.
Hardle, W., Smoothing Techniques with Implementation in S, Springer Verlag, New York, NY, 1991.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Spouge, J., Wan, H. & Wilbur, W. Least Squares Isotonic Regression in Two Dimensions. Journal of Optimization Theory and Applications 117, 585–605 (2003). https://doi.org/10.1023/A:1023901806339
Issue Date:
DOI: https://doi.org/10.1023/A:1023901806339