In this paper the problem of absolute stability is revisited. It is shown that it is possible to use convexity properties of the functions involved to develop an efficient algorithm for solving the absolute stability problem. Examples are presented to illustrate the results.3991929193
It is the intention of the authors of this paper to provide the reader with a general view of convex...
The book reviews the fundamentals of convexity, then describes the topologies on spaces of closed su...
The primary aim of this book is to present notions of convex analysis which constitute the basic und...
Abstract. We define and analyze two kinds of stability in E-convex programming problem in which the ...
We define and analyze two kinds of stability in E-convex programming problem in which the feasible d...
A theoretical analysis is carried out of the problem of checking the unconditional stability of a li...
A stability criterion for nonlinear systems, derived by the first author (2000), can be viewed as a ...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
This thesis is a study of stable perturbations in convex programming models. Stability of a general ...
Linear-convex and smooth-convex problems of optimal control are considered in the paper aiming at th...
Abstract—This paper generalizes the linear sector in the classical absolute stability theory to a se...
Let us say that a convex function f : C → [−∞, ∞] on a convex set C ⊆ R is infimum-stable if, for an...
AbstractThe concepts of convexity of a set, convexity of a function and monotonicity of an operator ...
Convex analysis is a branch of mathematics that studies convex sets, convex functions, and convex ex...
Resumo: Neste trabalho o problema da estabilidade absoluta de sistemas Lur'e é analisado. São consid...
It is the intention of the authors of this paper to provide the reader with a general view of convex...
The book reviews the fundamentals of convexity, then describes the topologies on spaces of closed su...
The primary aim of this book is to present notions of convex analysis which constitute the basic und...
Abstract. We define and analyze two kinds of stability in E-convex programming problem in which the ...
We define and analyze two kinds of stability in E-convex programming problem in which the feasible d...
A theoretical analysis is carried out of the problem of checking the unconditional stability of a li...
A stability criterion for nonlinear systems, derived by the first author (2000), can be viewed as a ...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
This thesis is a study of stable perturbations in convex programming models. Stability of a general ...
Linear-convex and smooth-convex problems of optimal control are considered in the paper aiming at th...
Abstract—This paper generalizes the linear sector in the classical absolute stability theory to a se...
Let us say that a convex function f : C → [−∞, ∞] on a convex set C ⊆ R is infimum-stable if, for an...
AbstractThe concepts of convexity of a set, convexity of a function and monotonicity of an operator ...
Convex analysis is a branch of mathematics that studies convex sets, convex functions, and convex ex...
Resumo: Neste trabalho o problema da estabilidade absoluta de sistemas Lur'e é analisado. São consid...
It is the intention of the authors of this paper to provide the reader with a general view of convex...
The book reviews the fundamentals of convexity, then describes the topologies on spaces of closed su...
The primary aim of this book is to present notions of convex analysis which constitute the basic und...
DOI
Add to ORKG