Robust Control via Sequential Semidefinite Programming

Authors:
  • BFB. Fares
    B. Fares
  • DND. Noll
    D. Noll
  • PAP. Apkarian
    P. Apkarian
Publisher website
Google Scholar
Abstract
This paper discusses nonlinear optimization techniques in robust control synthesis, with special emphasis on design problems which may be cast as minimizing a linear objective function under linear matrix inequality (LMI) constraints in tandem with nonlinear matrix equality constraints. The latter type of constraints renders the design numerically and algorithmically difficult. We solve the optimization problem via sequential semidefinite programming (SSDP), a technique which expands on sequential quadratic programming (SQP) known in nonlinear optimization. Global and fast local convergence properties of SSDP are similar to those of SQP, and SSDP is conveniently implemented with available semidefinite programming (SDP) solvers. Using two test examples, we compare SSDP to the augmented Lagrangian method, another classical scheme in nonlinear optimization, and to an approach using concave optimization.

This publication has 21 references indexed in Scilit: