# A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems

@article{Cerone2014AUF, title={A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems}, author={Vito Cerone and Jean B. Lasserre and Dario Piga and Diego Regruto}, journal={IEEE Transactions on Automatic Control}, year={2014}, volume={59}, pages={2897-2909} }

In this paper, we present a unified framework for solving a general class of problems arising in the context of set-membership estimation/identification theory. More precisely, the paper aims at providing an original approach for the computation of optimal conditional and robust projection estimates in a nonlinear estimation setting, where the operator relating the data and the parameter to be estimated is assumed to be a generic multivariate polynomial function, and the uncertainties affecting… Expand

#### 24 Citations

Computational burden reduction in set-membership identification of Wiener models

- Computer Science
- 2018

This paper proposes an original approach for reducing the computational load of the relaxed problems in terms of a reduction of the number of optimization variables and gives a numerical example to show the effectiveness of the proposed technique. Expand

Toward Tractable Global Solutions to Maximum-Likelihood Estimation Problems via Sparse Sum-of-Squares Relaxations*

- Computer Science
- 2019 IEEE 58th Conference on Decision and Control (CDC)
- 2019

A computationally tractable method that computes the maximum-likelihood parameter estimates with posterior certification of global optimality via the concept of sum-of-squares polynomials and sparse semidefinite relaxations is proposed. Expand

A single stage algorithm for set-membership Identification of nonlinear systems in Lur'e form

- Mathematics, Computer Science
- 2016 IEEE 55th Conference on Decision and Control (CDC)
- 2016

A single-stage procedure for set-membership identification of nonlinear systems in Lur'e form, where the nonlinear block can be modeled by a polynomial with finite and known order is proposed. Expand

Toward Tractable Global Solutions to Bayesian Point Estimation Problems via Sparse Sum-of-Squares Relaxations*

- Computer Science, Mathematics
- 2020 American Control Conference (ACC)
- 2020

This contribution proposes a computationally tractable method that computes the Bayesian parameter estimates with posterior certification of global optimality via sum-of-squares polynomials and sparse semidefinite relaxations. Expand

A linear programming approach to online set membership parameter estimation for linear regression models

- Mathematics
- 2017

This paper presents a new technique for online set membership parameter estimation of linear regression models affected by unknown-but-bounded noise. An orthotopic approximation of the set of… Expand

Bounded error identification exploiting a-priori information on noise whiteness and noise/output correlation

- Mathematics, Computer Science
- 2016 IEEE 55th Conference on Decision and Control (CDC)
- 2016

This paper proposes an original approach to compute the so-called parameter uncertainty intervals by properly taking into account all the available a-priori information about the model structure and the properties of the noise. Expand

Distributed Interpolatory Algorithms for Set Membership Estimation

- Computer Science, Mathematics
- IEEE Transactions on Automatic Control
- 2019

The main contribution of the paper is to show that two distributed algorithms considered are asymptotic interpolatory estimators, i.e., they converge to an element of the global feasible set, under the assumption that the feasible set associated to each measurement is convex. Expand

Set-membership errors-in-variables identification of MIMO linear systems

- Computer Science
- Autom.
- 2018

A general formulation that allows the user to take into account possible a-priori information on the structure of the MIMO model to be identified is proposed, in terms of a suitable polynomial optimization problem that is solved by means of a convex relaxation approach. Expand

Semialgebraic Outer Approximations for Set-Valued Nonlinear Filtering

- Mathematics, Computer Science
- 2019 18th European Control Conference (ECC)
- 2019

A sequential algorithm, based on sum-of-squares representation of positive polynomials is proposed to compute a semialgebraic set described by an a-priori fixed number of polynomial constraints which is guaranteed to contain the true state of the system with certainty. Expand

A robust unscented transformation for uncertain moments

- Mathematics, Computer Science
- J. Frankl. Inst.
- 2019

A robust version of the unscented transform for one-dimensional random variables is proposed, which yields a parametrized polynomial optimization problem, which in spite of being NP-Hard, can be relaxed by some algorithms that are proposed in this paper. Expand

#### References

SHOWING 1-10 OF 74 REFERENCES

A convex relaxation approach to set-membership identification of LPV systems

- Mathematics, Computer Science
- Autom.
- 2013

The aim of the thesis is to derive a number of convex-relaxation based algorithms that, exploiting the peculiar properties of the considered identification problems, make it possible to perform bound computation also when the number of measurements is large. Expand

Robust Solutions to Least-Squares Problems with Uncertain Data

- Mathematics, Computer Science
- 1997

We consider least-squares problems where the coefficient matrices A,b are unknown but bounded. We minimize the worst-case residual error using (convex) second-order cone programming, yielding an… Expand

Improved parameters bounds for set-membership EIV problems

- Computer Science
- 2011

In this paper, we consider the set-membership error-in-variables identification problem, that is the identification of linear dynamic systems when output and input measurements are corrupted by… Expand

Set-Membership Error-in-Variables Identification Through Convex Relaxation Techniques

- Mathematics, Computer Science
- IEEE Transactions on Automatic Control
- 2012

In this technical note, the set membership error-in-variables identification problem is considered, that is the identification of linear dynamic systems when both output and input measurements are… Expand

Optimal estimation theory for dynamic systems with set membership uncertainty: An overview

- Mathematics, Computer Science
- Autom.
- 1991

The main results of set membership or unknown but bounded (UBB) error description are reviewed, with special attention to the most recent advances obtained in the case of componentwise bounds. Expand

Conditionally optimal algorithms and estimation of reduced order models

- Computer Science, Mathematics
- J. Complex.
- 1988

Some extensions of the optimality results obtained in previous work on algorithms used in the field of system identification in the light of information-based complexity are presented. Expand

Conditional central algorithms for worst case set-membership identification and filtering

- Mathematics, Computer Science
- IEEE Trans. Autom. Control.
- 2000

The conditional Chebyshev center problem is solved for the case when energy norm-bounded disturbances are considered and a closed-form solution is obtained by finding the unique real root of a polynomial equation in a semi-infinite interval. Expand

Tight error bounds for projection algorithms in conditional set membership estimation

- Mathematics
- 1999

Abstract In set membership estimation, conditional problems arise when the estimate must belong to a given set of assigned structure. Conditional projection algorithms provide estimates that are… Expand

Convex relaxation techniques for set-membership identification of LPV systems

- Mathematics
- Proceedings of the 2011 American Control Conference
- 2011

Set-membership identification of single-input single-output linear parameter varying models is considered in the paper under the assumption that both the output and the scheduling parameter… Expand

Certifying convergence of Lasserre’s hierarchy via flat truncation

- Mathematics, Computer Science
- Math. Program.
- 2013

It is shown that flat truncation can be used as a certificate to check exactness of standard SOS relaxations and Jacobian SDP relaxations. Expand