Regularization tools and robust optimization for ill-conditioned least squares problem: A computational comparison

Maziar Salahi

doi:10.1016/j.amc.2011.02.100

Regularization tools and robust optimization for ill-conditioned least squares problem: A computational comparison

2011-06-01

3

PRE

AI

M

Maziar Salahi *

DOI：10.1016/j.amc.2011.02.100

Original

Original request for help

Save

Abstract

En 中文

Least squares problems arise frequently in many disciplines such as image restorations. In these areas, for the given least squares problem, usually the coefficient matrix is ill-conditioned. Thus if the problem data are available with certain error, then after solving least squares problem with classical approaches we might end up with a meaningless solution. Tikhonov regularization, is one of the most widely used approaches to deal with such situations. In this paper, first we briefly describe these approaches, then the robust optimization framework which includes the errors in problem data is presented. Finally, our computational experiments on several ill-conditioned standard test problems using the regularization tools, a Matlab package for least squares problem, and the robust optimization framework, show that the latter approach may be the right choice. (C) 2011 Elsevier Inc. All rights reserved.

Keywords:

Leat squares problem

Regularization tools

Tikhonov regularization

Robust optimization

Second order cone program

Regularization tools and robust optimization for ill-conditioned least squares problem: A computational comparison

Abstract

Journal

Organization