Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
From MaRDI portal
Publication:694844
DOI10.1016/j.automatica.2012.06.090zbMath1259.90088OpenAlexW2066437721MaRDI QIDQ694844
Publication date: 13 December 2012
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2012.06.090
linear matrix inequalitiesconvexitycentroidconservatismDC-representationnonlinear parameter dependencerobust semidefinite programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stability and stabilization of aperiodic sampled-data control systems using robust linear matrix inequalities
- Robust sampled-data stabilization of linear systems: an input delay approach
- Several NP-hard problems arising in robust stability analysis
- An optimal bound for d. c. programs with convex constraints
- Positive polynomials in control.
- Rigorous convex underestimators for general twice-differentiable problems
- DC programming: overview.
- Homogeneous polynomial forms for robustness analysis of uncertain systems
- A set-membership state estimation algorithm based on DC programming
- Matrix sum-of-squares relaxations for robust semi-definite programs
- LMI relaxations in robust control
- DC optimization approach to robust controls: the optimal scaling value problem
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
- EXPLOITING SPARSITY IN THE MATRIX-DILATION APPROACH TO ROBUST SEMIDEFINITE PROGRAMMING
- Robust Solutions to Uncertain Semidefinite Programs
- D.C. optimization approach to robust control: Feasibility problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Analysis of Non-polynomial Systems Using the Sum of Squares Decomposition
- Analysis and Synthesis of Nonlinear Systems With Uncertain Initial Conditions
- LMI Tests for Positive Definite Polynomials: Slack Variable Approach
- An Asymptotically Exact Approach to Robust Semidefinite Programming Problems with Function Variables
- Some Remarks on the Use of Time-Varying Delay to Model Sample-and-Hold Circuits
- Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
- Solving convex programs by random walks
- Convex analysis and global optimization
This page was built for publication: Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
