Add to ORKGRecently, a compact characterization of scalar positive polynomials on the real line and on the unit circle was derived by Nesterov [3]. In this paper we show how to extend this result to pseudo-polynomial matrices, and also present a new proof based on the positive real lemma. The characterization is very similar to the scalar case and also allows the use of fast algorithms for computing the central point of the corresponding convex set
This thesis is concerned with convex optimization problems over matrix polynomials that are constrai...
Abstract-In this note we give necessary and sufficient conditions in the frequency domain for ration...
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequa...
Positive polynomial matrices play a fundamental role in systems and control theory. We give here a s...
Positive polynomial matrices play a fundamental role in systems and control theory: they represent e...
The Nesterov characterizations of positive pseudopolynomials on the real line, the imaginary axis, a...
Polynomial optimization encompasses a very rich class of problems in which both the objective and co...
Strict positive realness (SPR) is an important concept in absolute stability theory, adaptive contro...
Scalar rational functions with a non-negative real part on the right half plane, called positive, ar...
It is the intention of the authors of this paper to provide the reader with a general view of convex...
It is the intention of the authors of this paper to provide the reader with a general view of convex...
It is the intention of the authors of this paper to provide the reader with a general view of convex...
It is the intention of the authors of this paper to provide the reader with a general view of convex...
The maximization of the third coefficient of the characteristic polynomial has been proved useful. I...
AbstractWe reveal some important geometric aspects related to non-convex optimization of sparse poly...
This thesis is concerned with convex optimization problems over matrix polynomials that are constrai...
Abstract-In this note we give necessary and sufficient conditions in the frequency domain for ration...
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequa...
Positive polynomial matrices play a fundamental role in systems and control theory. We give here a s...
Positive polynomial matrices play a fundamental role in systems and control theory: they represent e...
The Nesterov characterizations of positive pseudopolynomials on the real line, the imaginary axis, a...
Polynomial optimization encompasses a very rich class of problems in which both the objective and co...
Strict positive realness (SPR) is an important concept in absolute stability theory, adaptive contro...
Scalar rational functions with a non-negative real part on the right half plane, called positive, ar...
It is the intention of the authors of this paper to provide the reader with a general view of convex...
It is the intention of the authors of this paper to provide the reader with a general view of convex...
It is the intention of the authors of this paper to provide the reader with a general view of convex...
It is the intention of the authors of this paper to provide the reader with a general view of convex...
The maximization of the third coefficient of the characteristic polynomial has been proved useful. I...
AbstractWe reveal some important geometric aspects related to non-convex optimization of sparse poly...
This thesis is concerned with convex optimization problems over matrix polynomials that are constrai...
Abstract-In this note we give necessary and sufficient conditions in the frequency domain for ration...
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequa...