Results 1 
7 of
7
Robust Solutions To Uncertain Semidefinite Programs
 SIAM J. OPTIMIZATION
, 1998
"... In this paper we consider semidefinite programs (SDPs) whose data depend on some unknown but bounded perturbation parameters. We seek "robust" solutions to such programs, that is, solutions which minimize the (worstcase) objective while satisfying the constraints for every possible value ..."
Abstract

Cited by 109 (8 self)
 Add to MetaCart
(Show Context)
In this paper we consider semidefinite programs (SDPs) whose data depend on some unknown but bounded perturbation parameters. We seek "robust" solutions to such programs, that is, solutions which minimize the (worstcase) objective while satisfying the constraints for every possible value of parameters within the given bounds. Assuming the data matrices are rational functions of the perturbation parameters, we show how to formulate sufficient conditions for a robust solution to exist as SDPs. When the perturbation is "full," our conditions are necessary and sufficient. In this case, we provide sufficient conditions which guarantee that the robust solution is unique and continuous (Hölderstable) with respect to the unperturbed problem's data. The approach can thus be used to regularize illconditioned SDPs. We illustrate our results with examples taken from linear programming, maximum norm minimization, polynomial interpolation, and integer programming.
A Stable and Efficient Algorithm for the Indefinite Linear LeastSquares Problem
 SIAM J. Matrix Anal. Appl
, 1998
"... We develop an algorithm for the solution of indefinite leastsquares problems. Such problems arise in robust estimation, filtering, and control, and numerically stable solutions have been lacking. The algorithm developed herein involves the QR factorization of the coefficient matrix and is provably ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
We develop an algorithm for the solution of indefinite leastsquares problems. Such problems arise in robust estimation, filtering, and control, and numerically stable solutions have been lacking. The algorithm developed herein involves the QR factorization of the coefficient matrix and is provably numerically stable. keywords Indefinite leastsquares problems, error analysis, backward stability. 1 Introduction Many optimization criteria have been used for parameter estimation, starting with the standard leastsquares formulation of Gauss (ca. 1795) and moving to more recent works on total leastsquares (TLS) and robust (or H 1 ) estimation (see, e.g., [3, 4, 6, 7, 8, 9]). The latter formulations have been motivated by an increasing interest in estimators that are less sensitive to data uncertainties and measurement errors. They can both be shown to require the minimization of indefinite quadratic forms, where the standard inner product of two vectors, say a T b, is replaced by an...
Data Fitting Problems With Bounded Uncertainties In The Data
 SIAM J. MATRIX ANAL. APPL
, 2001
"... An analysis of a class of data tting problems, where the data uncertainties are subject to known bounds, is given in a very general setting. It is shown how such problems can be posed in a computationally convenient form, and the connection with other more conventional data fitting problems is exami ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
An analysis of a class of data tting problems, where the data uncertainties are subject to known bounds, is given in a very general setting. It is shown how such problems can be posed in a computationally convenient form, and the connection with other more conventional data fitting problems is examined. The problems have attracted interest so far in the special case when the underlying norm is the least squares norm. Here the special structure can be exploited to computational advantage, and we include some observations which contribute to algorithmic development for this particular case. We also consider some variants of the main problems and show how these too can be posed in a form which facilitates their numerical solution.
Robust Solutions To Linear Approximation Problems Under Ellipsoidal Uncertainty
 TOTAL LEAST SQUARES AND ERRORSIN VARIABLES MODELING, KLUWER
, 2002
"... The problem of tting a linear model to data, under uncertainty which can be regarded as being ellipsoidal, is considered in a very general setting. For a range of such problems, robust counterparts are established, and methods of solution are considered. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The problem of tting a linear model to data, under uncertainty which can be regarded as being ellipsoidal, is considered in a very general setting. For a range of such problems, robust counterparts are established, and methods of solution are considered.
1 A UNIQUENESS RESULT CONCERNING A ROBUST REGULARIZED LEASTSQUARES SOLUTION
"... Abstract. In solving a robust version of regularized leastsquares with weighting, a certain scalarvalued optimization problem is required in order to determine the regularized robust solution and the corresponding robustified weighting parameters. This letter establishes that the required optimiza ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In solving a robust version of regularized leastsquares with weighting, a certain scalarvalued optimization problem is required in order to determine the regularized robust solution and the corresponding robustified weighting parameters. This letter establishes that the required optimization problem does not have local, nonglobal minima over the interval of interest. This property is proved by resorting to a useful Schur complementation argument. The result is reassuring in that it demonstrates that the robust design procedure is well defined and that its optimal global solution can be determined without concerns about local minima. Key words. Regularization, leastsquares, Schur complement, game problem, uncertainty, optimization. 1. INTRODUCTION. Many
Dundee DD1 4HN Scotland
"... Robust solutions to a general class of approximation problems ..."
(Show Context)