Related papers: Stability Testing of Matrix Polytopes
We present a short step interior point method for solving a class of nonlinear programming problems with quadratic objective function. Convex quadratic programming problems can be reformulated as problems in this class. The method is shown…
We consider polynomial differential equations and make a number of contributions to the questions of (i) complexity of deciding stability, (ii) existence of polynomial Lyapunov functions, and (iii) existence of sum of squares (sos) Lyapunov…
An edge-weighted, vertex-capacitated graph G is called stable if the value of a maximum-weight capacity-matching equals the value of a maximum-weight fractional capacity-matching. Stable graphs play a key role in characterizing the…
A right quaternion matrix polynomial is an expression of the form $P(\lambda)= \displaystyle \sum_{i=0}^{m}A_i \lambda^i$, where $A_i$'s are $n \times n$ quaternion matrices with $A_m \neq 0$. The aim of this manuscript is to determine the…
This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…
We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…
We analyse the problem of stability of a continuous time linear switching system (LSS) versus the stability of its Euler discretization. It is well-known that the existence of a positive {\tau} for which the corresponding discrete time…
In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time…
We address the stability problem for linear switching systems with mode-dependent restrictions on the switching intervals. Their lengths can be bounded as from below (the guaranteed dwell-time) as from above. The upper bounds make this…
The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…
We study stability issue of reset and impulsive switched systems. We find time constraints (dwell time and flee time) on switching signals which stabilize a given reset switched system. For a given collection of matrices, we find an…
Consider the problem of determining whether there exists a spanning hypertree in a given k-uniform hypergraph. This problem is trivially in P for k=2, and is NP-complete for k>= 4, whereas for k=3, there exists a polynomial-time algorithm…
An important aspect in systems of multiple autonomous agents is the exploitation of synergies via coalition formation. In this paper, we solve various open problems concerning the computational complexity of stable partitions in additively…
We propose matrix commutator based stability characterization for discrete-time switched linear systems under restricted switching. Given an admissible minimum dwell time, we identify sufficient conditions on subsystems such that a switched…
In the Nonnegative Matrix Factorization (NMF) problem we are given an $n \times m$ nonnegative matrix $M$ and an integer $r > 0$. Our goal is to express $M$ as $A W$ where $A$ and $W$ are nonnegative matrices of size $n \times r$ and $r…
We show that the BIMATRIX game does not have a fully polynomial-time approximation scheme, unless PPAD is in P. In other words, no algorithm with time polynomial in n and 1/\epsilon can compute an \epsilon-approximate Nash equilibrium of an…
We consider the problem of computing the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints that admit quadratic relaxations. These non-convex constraints include semialgebraic sets and other…
Generalized mass-action systems are power-law dynamical systems arising from chemical reaction networks. Essentially, every nonnegative ODE model used in chemistry and biology (for example, in ecology and epidemiology) and even in economics…
We investigate the Euclidean $d$-Dimensional Stable Roommates problem, which asks whether a given set~$V$ of $d \cdot n$ points from the 2-dimensional Euclidean space can be partitioned into $n$ disjoint (unordered) subsets…
We investigate the stabilization of a multidimensional system of coupled wave equations with only one Kelvin Voigt damping. Using a unique continuation result based on a Carleman estimate and a general criteria of Arendt Batty, we prove the…