By Topic

A Subgradient Solution to Structured Robust Least Squares Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Moshe Salhov ; GoNet Systems, Tel Aviv, Israel

A standard and established method for solving a Least Squares problem in the presence of a structured uncertainty is to assemble and solve a semidefinite programming (SDP) equivalent problem. When the problem's dimensions are high, the solution of the structured robust least squares (RLS) problem via SDP becomes an expensive task in a computational complexity sense. We propose a subgradient based solution that utilizes the MinMax structure of the problem. This algorithm is justified by Danskin's MinMax Theorem and enjoys the well-known convergence properties of the subgradient method. The complexity of the new scheme is analyzed and its efficiency is verified by simulations of a robust equalization design.

Published in:

IEEE Transactions on Signal Processing  (Volume:58 ,  Issue: 9 )