How effective is the nuclear norm heuristic in solving data approximation problems?


Markovsky, Ivan (2012) How effective is the nuclear norm heuristic in solving data approximation problems? At 16th IFAC Symposium on System Identification (Sysid 2012), Belgium. 11 - 13 Jul 2012. 6 pp.

Download

[img] Other nucnrm-sysid-code.tar - Other
Download (20kB)
[img] PDF nucnrm-sysid.pdf - Other
Download (85kB)

Description/Abstract

The question in the title is answered empirically by solving instances of three classical problems: fitting a straight line to data, fitting a real exponent to data, and system identification in the errors-in-variables setting. The results show that the nuclear norm heuristic performs worse than alternative problem dependant methods---ordinary and total least squares, Kung's method, and subspace identification. In the line fitting and exponential fitting problems, the globally optimal solution is known analytically, so that the suboptimality of the heuristic methods is quantified.

Item Type: Conference or Workshop Item (Other)
Venue - Dates: 16th IFAC Symposium on System Identification (Sysid 2012), Belgium, 2012-07-11 - 2012-07-13
Related URLs:
Subjects:
Organisations: Southampton Wireless Group
ePrint ID: 336088
Date :
Date Event
March 2012Submitted
July 2012Published
Date Deposited: 14 Mar 2012 17:16
Last Modified: 17 Apr 2017 17:24
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/336088

Actions (login required)

View Item View Item