# On Equivalence and Computational Efficiency of the Major Relaxation Methods for Minimum Ellipsoid Containing the Intersection of Ellipsoids

@article{Wang2018OnEA, title={On Equivalence and Computational Efficiency of the Major Relaxation Methods for Minimum Ellipsoid Containing the Intersection of Ellipsoids}, author={Zhiguo Wang and Xiaojing Shen and Yunmin Zhu}, journal={arXiv: Optimization and Control}, year={2018} }

This paper investigates the problem on the minimum ellipsoid containing the intersection of multiple ellipsoids, which has been extensively applied to information science, target tracking and data fusion etc. There are three major relaxation methods involving SDP relaxation, S-procedure relaxation and bounding ellipsoid relaxation, which are derived by different ideas or viewpoints. However, it is unclear for the interrelationships among these methods. This paper reveals the equivalence among… Expand

#### One Citation

Dual Set Membership Filter with Minimizing Nonlinear Transformation of Ellipsoid

- Mathematics, Computer Science
- 2019

In this paper, we propose a dual set membership filter for nonlinear dynamic systems with unknown but bounded noises, and it has three distinctive properties. Firstly, the nonlinear system is… Expand

#### References

SHOWING 1-10 OF 38 REFERENCES

LMI Approximations for the Radius of the Intersection of Ellipsoids: Survey

- Mathematics
- 2001

This paper surveys various linear matrix inequality relaxation techniques for evaluating the maximum norm vector within the intersection of several ellipsoids. This difficult nonconvex optimization… Expand

An ellipsoidal calculus based on propagation and fusion

- Mathematics, Computer Science
- IEEE Trans. Syst. Man Cybern. Part B
- 2002

The presented formulation is numerically stable in the sense that it is immune to degeneracies of the involved ellipsoids and/or affine relations, and can be seen as a fusion followed by a propagation and an affine transformation as a particular case of propagation. Expand

LMI approximations for the radius of the intersection of ellipsoids

- Mathematics
- Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171)
- 1998

This paper addresses the problem of evaluating the maximum norm vector within the intersection of several ellipsoids. This difficult nonconvex optimization problem frequently arises in robust control… Expand

Decentralized data fusion with inverse covariance intersection

- Mathematics, Computer Science
- Autom.
- 2017

An extension of ellipsoidal intersection is proposed that guarantees consistent fusion results in the presence of unknown common information and proves to be more accurate than those provided by the well-known covariance intersection method. Expand

Minimizing Euclidian State Estimation Error for Linear Uncertain Dynamic Systems Based on Multisensor and Multi-Algorithm Fusion

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2011

Numerical examples show that the new method with multi-algorithm at both the sensors and the fusion center can significantly reduce the Euclidian estimation error of the state. Expand

Ellipsoidal bounds for uncertain linear equations and dynamical systems

- Mathematics, Computer Science
- Autom.
- 2004

Semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations and can be directly applied to various state-bounding problems for dynamical systems subject to set-valued noise and model uncertainty. Expand

Multi-Input Multi-Output Ellipsoidal State Bounding

- Mathematics
- 2001

Ellipsoidal state outer bounding has been considered in the literature since the late sixties. As in the Kalman filtering, two basic steps are alternated: a prediction phase, based on the… Expand

An order insensitive sequential fast covariance intersection fusion algorithm

- Mathematics, Computer Science
- Inf. Sci.
- 2016

In this article, data cross-correlation in distributed sensor system is investigated via an order insensitive sequential fast covariance intersection fusion algorithm that is computationally efficient and applicable for use in real-time fusion systems. Expand

Randomized Algorithms for Optimal Solutions of Double-Sided QCQP With Applications in Signal Processing

- Mathematics, Computer Science
- IEEE Transactions on Signal Processing
- 2014

This paper proposes several randomized postprocessing methods to output not an approximate solution but a globally optimal solution for some solvable instances of the double-sided QCQP, and derives an alternative (shorter) proof for the Sturm-Zhang rank-one matrix decomposition theorem. Expand

A Minimax Chebyshev Estimator for Bounded Error Estimation

- Mathematics, Computer Science
- IEEE Transactions on Signal Processing
- 2008

This work develops a nonlinear minimax estimator for the classical linear regression model assuming that the true parameter vector lies in an intersection of ellipsoids and shows that the RCC is unique and feasible, meaning it is consistent with the prior information. Expand