A Minmax Regret Linear Regression Model Under Uncertainty in the Dependent Variable

被引:0
|
作者
Eduardo Conde
机构
[1] University of Seville,Department of Statistics and Operations Research, Faculty of Mathematics
来源
Journal of Optimization Theory and Applications | 2014年 / 160卷
关键词
Robustness and sensitivity analysis; Minmax-regret models; Linear regression;
D O I
暂无
中图分类号
学科分类号
摘要
This paper analyzes the simple linear regression model corresponding to a sample affected by errors from a non-probabilistic viewpoint. We consider the simplest case where the errors just affect the dependent variable and there only exists one explanatory variable. Moreover, we assume the errors affecting each observation can be bounded. In this context the minmax regret criterion is used in order to obtain a regression line with nearly optimal goodness of fit for any true values of the dependent variable. Theoretical results as well as numerical methods are stated in order to solve the optimization problem under different residual cost functions.
引用
收藏
页码:573 / 596
页数:23
相关论文
共 50 条
  • [31] Lawler’s minmax cost problem under uncertainty
    Nadia Brauner
    Gerd Finke
    Yakov Shafransky
    Journal of Combinatorial Optimization, 2017, 34 : 31 - 46
  • [32] Lawler's minmax cost problem under uncertainty
    Brauner, Nadia
    Finke, Gerd
    Shafransky, Yakov
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (01) : 31 - 46
  • [33] Linear regression with Gaussian model uncertainty: Algorithms and bounds
    Wiesel, Ami
    Eldar, Yonina C.
    Yeredor, Arie
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (06) : 2194 - 2205
  • [34] A minmax regret median problem on a tree under uncertain locations of the demand points
    Conde, Eduardo
    OPERATIONS RESEARCH LETTERS, 2013, 41 (06) : 602 - 606
  • [35] A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network
    Bhattacharya, Binay
    Kameda, Tsunehiko
    Song, Zhao
    ALGORITHMICA, 2014, 70 (01) : 2 - 21
  • [36] A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network
    Binay Bhattacharya
    Tsunehiko Kameda
    Zhao Song
    Algorithmica, 2014, 70 : 2 - 21
  • [37] Linear versus logistic regression when the dependent variable is a dichotomy
    Ottar Hellevik
    Quality & Quantity, 2009, 43 : 59 - 74
  • [38] Linear versus logistic regression when the dependent variable is a dichotomy
    Hellevik, Ottar
    QUALITY & QUANTITY, 2009, 43 (01) : 59 - 74
  • [39] Interpretation of regression coefficients under a latent variable regression model
    Burnham, AJ
    MacGregor, JF
    Viveros, R
    JOURNAL OF CHEMOMETRICS, 2001, 15 (04) : 265 - 284
  • [40] Optimization Under Severe Uncertainty: a Generalized Minimax Regret Approach for Problems with Linear Objectives
    Vu, Tuan-Anh
    Afifi, Sohaib
    Lefevre, Eric
    Pichon, Frederic
    BELIEF FUNCTIONS: THEORY AND APPLICATIONS, BELIEF 2024, 2024, 14909 : 197 - 204