Two optimization problems in linear regression with interval data. (4th March 2017)

• Record Type: Journal Article
• Authors: Hladík, M.; Černý, M.
• Is Part Of: Optimization. Volume 66:Number 3(2017)
• Page Start: 331
• Page End: 349
• Publication Date: 2017-03-04
• Subjects: Linear regression -- interval data -- max–min optimization -- box-constrained optimization -- computational complexity; Mathematical optimization -- Periodicals; 519.7
• DOI: 10.1080/02331934.2016.1274988
• Languages: English
• ISSNs: 0233-1934

Abstract

Abstract: We consider a linear regression model where neither regressors nor the dependent variable is observable; only intervals are available which are assumed to cover the unobservable data points. Our task is to compute tight bounds for the residual errors of minimum-norm estimators of regression parameters with various norms (corresponding to least absolute deviations (LAD), ordinary least squares (OLS), generalized least squares (GLS) and Chebyshev approximation). The computation of the error bounds can be formulated as a pair of max–min and min–min box-constrained optimization problems. We give a detailed complexity-theoretic analysis of them. First, we prove that they are NP-hard in general. Then, further analysis explains the sources of NP-hardness. We investigate three restrictions when the problem is solvable in polynomial time: the case when the parameter space is known apriori to be restricted into a particular orthant, the case when the regression model has a fixed number of regression parameters, and the case when only the dependent variable is observed with errors. We propose a method, called orthant decomposition of the parameter space, which is the main tool for obtaining polynomial-time computability results.