Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
DOI10.1016/J.AUTOMATICA.2012.06.090zbMATH Open1259.90088OpenAlexW2066437721MaRDI QIDQ694844FDOQ694844
Authors: Yasuaki Oishi, T. Alamo 
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
Recommendations
- On approximate solutions for robust convex semidefinite optimization problems
- An Asymptotically Exact Approach to Robust Semidefinite Programming Problems with Function Variables
- Strong duality in parametric robust semi-definite linear programming and exact relaxations
- Robust least square semidefinite programming with applications
- A study on robust infeasibility of semidefinite programming
- A robust algorithm for semidefinite programming
- Robust Solutions to Uncertain Semidefinite Programs
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Matrix sum-of-squares relaxations for robust semi-definite programs
- scientific article; zbMATH DE number 2102031
centroidconvexitylinear matrix inequalitiesconservatismDC-representationnonlinear parameter dependencerobust semidefinite programming
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- DC programming: overview.
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Robust optimization
- Homogeneous polynomial forms for robustness analysis of uncertain systems
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Title not available (Why is that?)
- Moments, positive polynomials and their applications
- Title not available (Why is that?)
- Analysis of Non-polynomial Systems Using the Sum of Squares Decomposition
- Solving convex programs by random walks
- Robust convex optimization
- Robust Solutions to Uncertain Semidefinite Programs
- Title not available (Why is that?)
- Robust sampled-data stabilization of linear systems: an input delay approach
- Convex analysis and global optimization
- Some Remarks on the Use of Time-Varying Delay to Model Sample-and-Hold Circuits
- A set-membership state estimation algorithm based on DC programming
- Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
- Stability and stabilization of aperiodic sampled-data control systems using robust linear matrix inequalities
- Positive polynomials in control.
- LMI relaxations in robust control
- On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty
- Exploiting sparsity in the matrix-dilation approach to robust semidefinite programming
- Several NP-hard problems arising in robust stability analysis
- An optimal bound for d. c. programs with convex constraints
- Rigorous convex underestimators for general twice-differentiable problems
- Analysis and Synthesis of Nonlinear Systems With Uncertain Initial Conditions
- An Asymptotically Exact Approach to Robust Semidefinite Programming Problems with Function Variables
- LMI Tests for Positive Definite Polynomials: Slack Variable Approach
- DC optimization approach to robust controls: The optimal scaling value problem
- Approximating the centroid is hard
- D.C. optimization approach to robust control: Feasibility problems
Uses Software
This page was built for publication: Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694844)
