Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

HP.com home

Technical Reports


HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» Worldwide sites
» Downloads
Content starts here


Regularization of Least Square Problems via Prior Information

Fozunbal, Majid

External - Copyright Consideration

Keyword(s): identification; least squares methods; linear systems; uncertainty; regularization

Abstract: We consider uncertainty reduction in least square problems raised in system identification with unknown state space. We assume existence of some prior information obtained through a finite series of measurements. This data is modeled in the form of a finite collection of ellipsoids enclosing the state space. A simple closed form expression is derived for the optimal solution featuring geometric insights and intuitions that reveal a two-fold effort in reducing uncertainty: by correcting the observation error and by improving the condition number of the data matrix. To deal with the dual problem of finding the optimal Lagrange multipliers, we introduce an approximate, linear positive semidefinite program that can be easily solved using the standard numerical techniques.

9 Pages

Back to Index

»Technical Reports

» 2009
» 2008
» 2007
» 2006
» 2005
» 2004
» 2003
» 2002
» 2001
» 2000
» 1990 - 1999

Heritage Technical Reports

» Compaq & DEC Technical Reports
» Tandem Technical Reports
Printable version
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.