Publication

Convex computation of the region of attraction of polynomial control systems

Related publications (40)

Quasiconvexity and Relaxation in Optimal Transportation of Closed Differential Forms

This manuscript extends the relaxation theory from nonlinear elasticity to electromagnetism and to actions defined on paths of differential forms. The introduction of a gauge allows for a reformulation of the notion of quasiconvexity in Bandyopadhyay et al ...

SPRINGER2019

A Data-Driven Frequency-Domain Approach for Robust Controller Design via Convex Optimization

Achille Nicoletti

The objective of this dissertation is to develop data-driven frequency-domain methods for designing robust controllers through the use of convex optimization algorithms. Many of today's industrial processes are becoming more complex, and modeling accurate ...

EPFL2018

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H-infinity Performance

Alireza Karimi, Achille Nicoletti

Recently, a new data-driven method for robust control with H-infinity performance has been proposed. This method is based on convex optimization and converges to the optimal performance when the controller order increases. However, for low-order controller ...

IEEE2018

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H∞ Performance

Alireza Karimi, Achille Nicoletti

Recently, a new data-driven method for robust control with H∞ performance has been proposed. This method is based on convex optimization and converges to the optimal performance when the controller order increases. However, for low-order controllers, the p ...

Elsevier2018

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H∞ Performance

Alireza Karimi, Achille Nicoletti

Recently, a new data-driven method for robust control with H ∞ performance has been proposed. This method is based on convex optimization and converges to the optimal performance when the controller order increases. However, for low-order controllers, the ...

2018

Technical Report: Control of Nonlinear Systems with Explicit-MPC-like Controllers

Colin Neil Jones, Milan Korda, Ivan Pejcic

This paper describes synthesis of controllers involving Quadratic Programming (QP) optimization problems for control of nonlinear systems. The QP structure allows an implementation of the controller as a piecewise affine function, pre-computed offline, whi ...

2017

A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

Nicolas Dousse

We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment. We address the problem of determining the routing of material between co ...

Elsevier2016

MATHICSE Technical Report : A fast gradient method for nonnegative sparse regression with self dictionary

Robert Gerhard Jérôme Luce

Nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the input data matrix belong to the convex cone generated by only a few of its columns. The provably most robust met ...

MATHICSE2016

Guaranteeing Input Tracking For Constrained Systems: Theory and Application to Demand Response

Colin Neil Jones, Tomasz Tadeusz Gorecki, Georgios Stathopoulos, Altug Bitlislioglu

A method for certifying exact input trackability for constrained discrete time linear systems is introduced in this paper. A signal is assumed to be drawn from a reference set and the system must track this signal with a linear combination of its inputs. U ...

2015

A totally unimodular view of structured sparsity

Volkan Cevher, Marwa El Halabi

This paper describes a simple framework for structured sparse recovery based on convex optimization. We show that many interesting structured sparsity models can be naturally represented by linear matrix inequalities on the support of the unknown parameter ...

2015

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.