AbstractPrevious work [3, 4, 5] on solvability theorems for linear equations over cones and cones with interior is continued. Applications to matrix theory include a theorem of Bellman and Fan [2], and generalizations of Lyapunov theorem
The matrix equation SA+A*S=S*B*BS is studied, under the assumption that (A, B*) is controllable, but...
AbstractLinear programming is formulated with the vector variable replaced by a matrix variable, wit...
AbstractNew inequalities for eigenvalues of matrices are obtained. They make Schur's and Brown's the...
AbstractThe solvability of linear equations with solutions in the interior of a closed convex cone i...
summary:Standard facts about separating linear functionals will be used to determine how two cones $...
AbstractLyapunov, while studying the asymptotic stability of solutions of differential systems, prov...
We systematically study how properties of abstract operator systems help classifying linear matrix i...
AbstractConvex cones of matrices which are closed under matrix inversion are defined, and their stru...
AbstractWe apply a recent characterization of optimality for the abstract convex program with a cone...
AbstractLet V be a Euclidean Jordan algebra with symmetric cone K. We show that if a linear transfor...
In this paper, the structure of several convex cones that arise in the study of Lyapunov functions i...
AbstractLet K be a proper cone in Rn, let A be an n×n real matrix that satisfies AK⊆K, let b be a gi...
AbstractA consistency criterion for systems of linear inequalities is applied to prove an existence ...
A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone...
summary:We define the linear capacity of an algebraic cone, give basic properties of the notion and ...
The matrix equation SA+A*S=S*B*BS is studied, under the assumption that (A, B*) is controllable, but...
AbstractLinear programming is formulated with the vector variable replaced by a matrix variable, wit...
AbstractNew inequalities for eigenvalues of matrices are obtained. They make Schur's and Brown's the...
AbstractThe solvability of linear equations with solutions in the interior of a closed convex cone i...
summary:Standard facts about separating linear functionals will be used to determine how two cones $...
AbstractLyapunov, while studying the asymptotic stability of solutions of differential systems, prov...
We systematically study how properties of abstract operator systems help classifying linear matrix i...
AbstractConvex cones of matrices which are closed under matrix inversion are defined, and their stru...
AbstractWe apply a recent characterization of optimality for the abstract convex program with a cone...
AbstractLet V be a Euclidean Jordan algebra with symmetric cone K. We show that if a linear transfor...
In this paper, the structure of several convex cones that arise in the study of Lyapunov functions i...
AbstractLet K be a proper cone in Rn, let A be an n×n real matrix that satisfies AK⊆K, let b be a gi...
AbstractA consistency criterion for systems of linear inequalities is applied to prove an existence ...
A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone...
summary:We define the linear capacity of an algebraic cone, give basic properties of the notion and ...
The matrix equation SA+A*S=S*B*BS is studied, under the assumption that (A, B*) is controllable, but...
AbstractLinear programming is formulated with the vector variable replaced by a matrix variable, wit...
AbstractNew inequalities for eigenvalues of matrices are obtained. They make Schur's and Brown's the...
DOI
Add to ORKG