A new approximate algorithm for the Chebyshev center
From MaRDI portal
Publication:2628686
DOI10.1016/j.automatica.2013.04.029zbMath1364.93788OpenAlexW2053423985MaRDI QIDQ2628686
Publication date: 2 June 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2013.04.029
bounded noiseChebyshev centerestimation fusionellipsoidal estimationpositive semidefinite relaxation
Nonconvex programming, global optimization (90C26) Estimation and detection in stochastic control theory (93E10)
Related Items (6)
Unnamed Item ⋮ On equivalence of major relaxation methods for minimum ellipsoid covering intersection of ellipsoids ⋮ Chebyshev center of the intersection of balls: complexity, relaxation and approximation ⋮ Chebyshev center and inscribed balls: properties and calculations ⋮ Covering a set by a convex compactum: error estimates and computation ⋮ Estimation fusion for distributed multi-sensor systems with uncertain cross-correlations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameter estimation algorithms for a set-membership description of uncertainty
- Optimal estimation theory for dynamic systems with set membership uncertainty: An overview
- Chebyshev centers and uniform convexity
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Solution methodologies for the smallest enclosing circle problem
- Ellipsoidal parameter or state estimation under model uncertainty
- Optimal algorithms theory for robust estimation and prediction
- Identification for systems with bounded noise
- A Minimax Chebyshev Estimator for Bounded Error Estimation
- Regularization in Regression with Bounded Noise: A Chebyshev Center Approach
- Set-Membership Error-in-Variables Identification Through Convex Relaxation Techniques
This page was built for publication: A new approximate algorithm for the Chebyshev center
