A semi-definite programming approach for robust tracking
From MaRDI portal
Publication:263222
DOI10.1007/s10107-015-0910-5zbMath1353.90105OpenAlexW1580134875MaRDI QIDQ263222
Aharon Ben-Tal, Shimrit Shtern
Publication date: 4 April 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0910-5
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Minimax problems in mathematical programming (90C47) Linear systems in control theory (93C05)
Related Items (2)
A non-probabilistic methodology for reliable sustainability planning: an application to the Iraqi national irrigation system ⋮ Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Ellipsoidal calculus for estimation and control
- Deterministic least squares filtering.
- An adaptive robustizing approach to Kalman filtering
- Filtering and smoothing in an H/sup infinity / setting
- Approximate non-Gaussian filtering with linear state and observation relations
- Robust bayesian estimation for the linear model and robustifying the Kalman filter
- Robust Kalman filtering for uncertain discrete-time systems
- Semidefinite relaxation and nonconvex quadratic optimization
- Conditional central algorithms for worst case set-membership identification and filtering
- A framework for state-space estimation with uncertain models
- Robust filtering for discrete-time systems with bounded noise and parametric uncertainty
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- An Interior-Point Method for Semidefinite Programming
- Robust Kalman filtering for discrete time-varying uncertain systems with multiplicative noises
- Finite-horizon robust Kalman filter design
- Sparse Approximate Solutions to Semidefinite Programs
- A very simple proof of the multivariate Chebyshev's inequality
- \(H^ \infty\)-optimal control and related minimax design problems. A dynamic game approach.
This page was built for publication: A semi-definite programming approach for robust tracking
