Robust Control via Sequential Semidefinite Programming
A new nonlinear optimization technique is proposed to solve non-convex problems arising in robust control design, where a control law ensuring stability and performance is sought for a given uncertain linear system. Such nonconvex optimization problems can be formulated in various ways (minimization of a concave objective function under linear matrix inequality (LMI) constraints; rank-constrained LMI; bilinear matrix inequalities (BMI); LMI with additional nonlinear algebraic constraints) and various techniques have been proposed in the technical literature to address these problems (branch-and-bound algorithms; conic complementarity linearization; augmented Lagrangian methods). Another, still different technique is proposed in this paper. The proposed numerical method solves LMI problems with additional nonlinear algebraic constraints. It is an extension of sequential quadratic programming to the cone of positive semidefinite matrices, referred to as sequential semidefinite programming. Minimization at each step of the second-order Taylor expansion of the Lagrangian of the problem amounts to solving an LMI problem instead of a quadratic problem. Theoretical proofs of local super-linear and quadratic convergence of the algorithm are given. Using two standard, yet meaningful, small-size test examples (robust control of a flexible actuator and robust autopilot of a missile) it is shown that the proposed algorithm performs favorably compared to augmented Lagrangian methods or concave programming. The bottleneck of the algorithm resides in the limitation of available general-purpose semidefinite programming solvers, currently limited to a few thousand design variables.
- On the solution of a nonlinear semidefinite program arising in discrete-time feedback control design
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- Nonconvex spectral optimization algorithms for reduced-order \(\mathcal{H}_\infty\) LPV-LFT controllers
- An SQP augmented Lagrangian method for two classes of nonlinear semidefinite programming problems arising in discrete-time feedback control
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- Computational complexity reduction in scaled \({\mathcal H}_ \infty\) synthesis
- A sequential LMI approach to design a BMI-based multi-objective nonlinear observer
- The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
- A novel neural network model for solving a class of nonlinear semidefinite programming problems
- On self-regular IPMs (with comments and rejoinder)
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- An augmented Lagrangian method for the optimal \(H_\infty\) model order reduction problem
- A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming
- On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming
- Optimality conditions and global convergence for nonlinear semidefinite programming
- A line search exact penalty method for nonlinear semidefinite programming
- Sequential parametric convex approximation algorithm for bilinear matrix inequality problem
- A quadratic matrix inequality based PID controller design for LPV systems
- On saddle points in semidefinite optimization via separation scheme
- A globally convergent QP-free algorithm for nonlinear semidefinite programming
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- Second-order nonsmooth optimization for \(H_{\infty}\) synthesis
- Generalized separation theorems and the Farkas' lemma
- An approximation technique for robust nonlinear optimization
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs
- A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis
- Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- A successive SDP-NSDP approach to a robust optimization problem in finance
- Low nonconvexity-rank bilinear matrix inequalities: Algorithms and applications in robust controller and structure designs
- Elementary optimality conditions for nonlinear SDPs
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- Optimality conditions in semidefinite programming
- Robust design and robust stability analysis of active noise control systems
- Optimization under Uncertainty via CometBoards
- Nonconvex spectral optimization algorithms for reduced-order \(\mathcal{H}_\infty\) LPV-LFT controllers
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- A new nonlinear Lagrangian method for nonconvex semidefinite programming
- A homotopy method for nonlinear semidefinite programming
- The challenge of equality constraints in robust design optimization: examination and new approach
- Discussion on: ``Design of low order robust controllers for a VSC HVDC power plant terminal
- A sequential quadratic penalty method for nonlinear semidefinite programming
- A sequential quadratic penalty method for nonlinear semidefinite programming
- Robust controller synthesis via non-linear matrix inequalities
- Robust control via concave minimization local and global algorithms
- An SQP-type method with superlinear convergence for nonlinear semidefinite programming
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
- A homotopy method based on penalty function for nonlinear semidefinite programming
- Covariate regularized community detection in sparse graphs
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- Memory-efficient structured convex optimization via extreme point sampling
- Superlinear convergence of an SQP-type method for nonlinear semidefinite programming
- Sampling method for semidefinite programmes with non-negative Popov function constraints
- Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- A perturbation method for optimizing matrix stability
- A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization
- A self-concordance property for nonconvex semidefinite programming
- Less conservative robust control of parametric systems: Lagrange approach and metaheuristic design
- Superlinear convergence of a stabilized SQP-type method for nonlinear semidefinite programming
- Optimality conditions for a class of nonsmooth semidefinite bilevel optimization problems via convexifications applied to bilevel supply chain under uncertainty
- A primal-dual interior point method for nonlinear semidefinite programming
- Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
- On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
- Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming
- Successive linearization methods for nonlinear semidefinite programs
- Duality theories in nonlinear semidefinite programming
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- A Newton-like method for solving rank constrained linear matrix inequalities
- A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
- Lower-order penalization approach to nonlinear semidefinite programming
This page was built for publication: Robust Control via Sequential Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537811)