Fast algorithms for solving IQC feasibility and optimization problems

Proceedings of the American Control Conference

Volumn 4, Issue , 2001, Pages 3019-3024

  Kao, Chung Yao ^a   Megretski, Alexandre ^a  

^a MIT   (Malaysia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONTROL NONLINEARITIES; INTEGRATION; QUADRATIC PROGRAMMING; ROBUSTNESS (CONTROL SYSTEMS); UNCERTAIN SYSTEMS;

HURWITZ MATRIX; INTEGRAL QUADRATIC CONSTRAINTS; LINEAR MATRIX INEQUALITY;

OPTIMIZATION;

EID: 0034857591     PISSN: 07431619     EISSN: None     Source Type: Journal    
DOI: 10.1109/ACC.2001.946376     Document Type: Article

References (14)

1. A cutting plane algorithm for convex programming that uses analytic centers
2. Convex nondifferentiable optimization: A survey focussed on the analytical center cutting plane method
3. Efficient solution of linear matrix inequalities for integral quadratic constraints
4. Complexity analysis of an interior cutting plane method for convex feasibility problems
5. Robustness analysis of uncertain and nonlinear systems
6. An algorithm for solving special frequency dependent LMIs
7. A polynomial algorithm in linear programming
8. System analysis via integral quadratic constraints
9. Cutting plane algorithms from analytical centers: Efficient estimates
10. Interior point polynomial methods in convex programming
11. On the numerical solution of LMIs derived from the KYP lemma
12. A primal-dual potential reduction method for problems involving matrix inequalities
13. Semidefinite programming