Distributionally robust L1-estimation in multiple linear regression
dc.contributor.author | Gong, Z. | |
dc.contributor.author | Liu, C. | |
dc.contributor.author | Sun, Jie | |
dc.contributor.author | Teo, Kok Lay | |
dc.date.accessioned | 2018-12-13T09:16:04Z | |
dc.date.available | 2018-12-13T09:16:04Z | |
dc.date.created | 2018-12-12T02:46:42Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | Gong, Z. and Liu, C. and Sun, J. and Teo, K.L. 2018. Distributionally robust L1-estimation in multiple linear regression. Optimization Letters. 13 (4): pp. 935-947. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/73292 | |
dc.identifier.doi | 10.1007/s11590-018-1299-x | |
dc.description.abstract |
Linear regression is one of the most important and widely used techniques in data analysis, for which a key step is the estimation of the unknown parameters. However, it is often carried out under the assumption that the full information of the error distribution is available. This is clearly unrealistic in practice. In this paper, we propose a distributionally robust formulation of L1-estimation (or the least absolute value estimation) problem, where the only knowledge on the error distribution is that it belongs to a well-defined ambiguity set. We then reformulate the estimation problem as a computationally tractable conic optimization problem by using duality theory. Finally, a numerical example is solved as a conic optimization problem to demonstrate the effectiveness of the proposed approach. | |
dc.publisher | Springer Verlag | |
dc.relation.sponsoredby | http://purl.org/au-research/grants/arc/DP160102819 | |
dc.relation.sponsoredby | http://purl.org/au-research/grants/arc/DP140100289 | |
dc.title | Distributionally robust L1-estimation in multiple linear regression | |
dc.type | Journal Article | |
dcterms.source.issn | 1862-4472 | |
dcterms.source.title | Optimization Letters | |
curtin.department | School of Electrical Engineering, Computing and Mathematical Science (EECMS) | |
curtin.accessStatus | Open access |