A cutting plane algorithm for convex programming that uses analytic centers
Mathematical Programming: Series A and B
Mathematics of Operations Research
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
SIAM Journal on Optimization
Robust Solutions to Uncertain Semidefinite Programs
SIAM Journal on Optimization
On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
SIAM Journal on Optimization
A Convex Approach to Robust Stability for Linear Systems with Uncertain Scalar Parameters
SIAM Journal on Control and Optimization
Convex Optimization
Uncertain convex programs: randomized solutions and confidence levels
Mathematical Programming: Series A and B
Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
SIAM Journal on Matrix Analysis and Applications
Automatica (Journal of IFAC)
Cutting-set methods for robust convex optimization with pessimizing oracles
Optimization Methods & Software
Brief paper: Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
Automatica (Journal of IFAC)
Survey paper: Research on probabilistic methods for control system design
Automatica (Journal of IFAC)
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
SIAM Journal on Optimization
| Hi-index | 22.15 |
Many robust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F@?{f(x,@d)=