Specialized fast algorithms for IQC feasibility and optimization problems.

DOI10.1016/j.automatica.2003.09.016zbMath1034.93021OpenAlexW2062571764MaRDI QIDQ1428693

Alexandre Megretski, Chung-Yao Kao, Ulf T. Jönsson

Publication date: 29 March 2004

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2003.09.016

zbMATH Keywords

Semidefinite programmingCutting plane methodStability analysisIntegral quadratic constraintPositive real lemma

Mathematics Subject Classification ID

Semidefinite programming (90C22) Asymptotic stability in control theory (93D20)

Related Items

Robust stability and performance analysis based on integral quadratic constraints, IQC analysis and synthesis via nonsmooth optimization, A decomposition algorithm for KYP-SDPs, A cutting plane method for solving KYP-SDPs, Systems with sector bound nonlinearities: a behavioral approach, Time domain interpretations of frequency domain inequalities on (semi)finite ranges, An oracle for the discrete-time integral quadratic constraint problem, Design and robustness analysis of fighter aircraft flight control laws, Low-rank exploitation in semidefinite programming for control, Sampling method for semidefinite programmes with non-negative Popov function constraints

Uses Software

• ACCPM
• Mu Analysis and Synthesis Toolbox
• QDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cutting planes and column generation techniques with the projective algorithm
• Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
• A two-cut approach in the analytic center cutting plane method
• Geometric algorithms and combinatorial optimization.
• On the Kalman-Yakubovich-Popov lemma
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
• Shallow, deep and very deep cuts in the analytic center cutting plane method.
• A cutting plane algorithm for convex programming that uses analytic centers
• A cutting plane method from analytic centers for stochastic programming
• Complexity estimates of some cutting plane methods based on the analytic barrier
• Dissipative dynamical systems. I: General theory
• Multiple Cuts in the Analytic Center Cutting Plane Method
• A multiloop generalization of the circle criterion for stability margin analysis
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• A Potential Reduction Algorithm Allowing Column Generation
• System analysis via integral quadratic constraints
• Semidefinite Programming
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems