Alternatives for optimization in systems and control: convex and non-convex approaches

Abstract

In this presentation, we will develop a short overview of main trends of optimization in systems and control, and from there outline some new perspectives emerging today. More specifically, we will focus on the current situation, where it is clear that convex and Linear Matrix Inequality (LMI) methods have become the most common option. However, because of its vast success, the convex approach is often the only direction considered, despite the underlying problem is non-convex and that other optimization methods specifically equipped to handle such problems should have been used instead. We will present key points on this topic, and as a side result we will propose a method to produce a virtually infinite number of papers.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…