Optimization on linear matrix inequalities for polynomial systems control

@article{Henrion2013OptimizationOL,
  title={Optimization on linear matrix inequalities for polynomial systems control},
  author={Didier Henrion},
  journal={arXiv: Optimization and Control},
  year={2013}
}
  • D. Henrion
  • Published 13 May 2013
  • Mathematics, Computer Science
  • arXiv: Optimization and Control
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate approximate solutions in floating point arithmetic. In the first part of the course we describe semidefinite programming (SDP) as an extension of linear programming (LP) to the cone of positive semidefinite matrices. We investigate the geometry of spectrahedra… 

Figures from this paper

Mini-course on polynomial optimization and control

In the early 2000s, several research groups realized that the linear matrix inequality (LMI) framework existing for analysis and control of linear dynamical systems [3] can be extended significantly

Exact algorithms for determinantal varieties and semidefinite programming. (Algorithmes exacts pour les variétés déterminantielles et la programmation semi-définie)

It is proved that deciding the feasibility of a LMI can be performed by computing a sample set of real solutions of determinantal polynomial systems, and an exact algorithm for deciding the viability of a linear matrix inequality (LMI) is designed.

Exact algorithms for linear matrix inequalities

An exact algorithm is designed that, up to genericity assumptions on the input matrices, computes an exact algebraic representation of at least one point in the spectrahedron, or decides that it is empty.

A semidefinite programming approach for polynomial switched optimal control problems

This paper considers solving optimal control of switched systems with polynomial data globally, where the number of switches and the switching signal are not preassigned. The problem is transformed

A semidefinite programming approach for solving fractional optimal control problems

Abstract This paper presents a numerical scheme for solving fractional optimal control. The fractional derivative in this problem is in the Riemann–Liouville sense. The proposed method, based upon

Approximating regions of attraction of a sparse polynomial differential system

Positivity Certificates in Optimal Control

A tutorial on relaxations and weak formulations of optimal control with their semidefinite approximations through the prism of positivity certificates, which is considered to be the most accessible for a broad audience, in particular in the engineering and robotics communities.

Infinite-Dimensional Sums-of-Squares for Optimal Control

In this paper, we introduce an approximation method to solve an optimal control problem via the Lagrange dual of its weak formulation, which applies to problems with an unknown, non-necessarily

Linear Conic Optimization for Inverse Optimal Control

This work proposes a general formulation of the inverse problem of Lagrangian identification based on occupation measures and complementarity in linear programming based on an approximation procedure for which strong theoretical guarantees are available.

References

SHOWING 1-10 OF 63 REFERENCES

Interior-point polynomial algorithms in convex programming

This book describes the first unified theory of polynomial-time interior-point methods, and describes several of the new algorithms described, e.g., the projective method, which have been implemented, tested on "real world" problems, and found to be extremely efficient in practice.

Sums of Squares, Moment Matrices and Optimization Over Polynomials

This work considers the problem of minimizing a polynomial over a semialgebraic set defined byPolynomial equations and inequalities, which is NP-hard in general and reviews the mathematical tools underlying these properties.

Linear matrix inequality representation of sets

This article concerns the question, Which subsets of ℝm can be represented with linear matrix inequalities (LMIs)? This gives some perspective on the scope and limitations of one of the most powerful

Linear Matrix Inequalities In System And Control Theory

  • E. Yaz
  • Mathematics
    Proceedings of the IEEE
  • 1998
Preface 1. Introduction Overview A Brief History of LMIs in Control Theory Notes on the Style of the Book Origin of the Book 2. Some Standard Problems Involving LMIs. Linear Matrix Inequalities Some

Moments, Positive Polynomials And Their Applications

The semidefinite programming methodology to solve the generalized problem of moments is presented and several applications of the GPM are described in detail (notably in optimization, probability, optimal control andmathematical finance).

Solving nonconvex optimization problems

The objective of this article is to show how GloptiPoly can solve challenging nonconvex optimization problems in robust nonlinear control in control system analysis and design.

Squared Functional Systems and Optimization Problems

It is proved that such cones can be always seen as a linear image of the cone of positive semidefinite matrices, and a description of the cones of univariate and non-negative trigonometric polynomials is given.

Relaxation in Optimization Theory and Variational Calculus

Background generalities: order and topology linear and convex analysis optimization theory functions and measure spaces means of continuous functions some differential and integral equations

Semidefinite programming and integer programming

Global Optimization with Polynomials and the Problem of Moments

It is shown that the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): R n to R, in a compact set K defined byPolynomial inequalities reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems.
...