Related papers: Complexity of Ten Decision Problems in Continuous …
For a dynamical system, it is known that the existence of a Lyapunov-type density function, called Lyapunov density or Rantzer's density function, implies convergence of Lebesgue almost all solutions to an equilibrium. Using the duality…
It is shown that graph-theoretic problem CLIQUE can't be solved in polynomial time by any deterministic TM. This upgrades the well-known partial result that claims only monotone unsolvability thereof, and eventually implies P $\neq$ NP as…
A complete classification of the computational complexity of the fixed-point existence problem for boolean dynamical systems, i.e., finite discrete dynamical systems over the domain {0, 1}, is presented. For function classes F and graph…
A group of $n$ agents with numerical preferences for each other are to be assigned to the $n$ seats of a dining table. We study two natural topologies:~circular (cycle) tables and panel (path) tables. For a given seating arrangement, an…
Discrete time control systems whose dynamics and observations are described by stochastic equations are common in engineering, operations research, health care, and economics. For example, stochastic filtering problems are usually defined…
We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specified graphs, many of which are PSPACE-complete. Assuming P != PSPACE, the existence or nonexistence of such efficient…
We prove that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can test whether the optimal value of a nonlinear optimization problem where the objective and constraints are given by low-degree…
This paper deals with asymptotic stability of a class of dynamical systems in terms of smooth Lyapunov pairs. We point out that well known converse Lyapunov results for differential inclusions cannot be applied to this class of dynamical…
In this paper, we consider the stability of discrete-time linear switched systems with a common non-strict Lyapunov matrix.
We construct a family of globally defined dynamical systems for a nonlinear programming problem, such that: (a) the equilibrium points are the unknown (and sought) critical points of the problem, (b) for every initial condition, the…
In the stable marriage and roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually accepted agents. If any…
We reconsider both the global and local stability of solutions of continuously evolving dynamical systems from a geometric perspective. We clarify that an unambiguous definition of stability generally requires the choice of additional…
We introduce the concept of sos-convex Lyapunov functions for stability analysis of both linear and nonlinear difference inclusions (also known as discrete-time switched systems). These are polynomial Lyapunov functions that have an…
We study a polynomial-time decision problem in which each input encodes a depth-$N$ causal execution in which a single non-duplicable token must traverse an ordered sequence of steps, revealing at most $O(1)$ bits of routing information at…
The paper is concerned with mechanical systems which are controlled by implementing a number of time-dependent, frictionless holonomic constraints. The main novelty is due to the presence of additional non-holonomic constraints. We develop…
In this paper, we discuss the relationships between stability and almost periodicity for solutions of stochastic differential equations. Our essential idea is to get stability of solutions or systems by some inherited properties of Lyapunov…
In the article$^a$, the authors introduced a time-varying Lyapunov function for the stability analysis of nonlinear systems whose motion is governed by standard Newton-Euler equations. The authors established asymptotic stability with the…
The development of finite/fixed-time stable optimization algorithms typically involves study of specific problem instances. The lack of a unified framework hinders understanding of more sophisticated algorithms, e.g., primal-dual gradient…
We consider a stochastic partial differential equation close to bifurcation of pitchfork type, where a one-dimensional space changes its stability. For finite-time Lyapunov exponents we characterize regions depending on the distance from…
An overview of stability conditions in terms of the Lyapunov matrix for time-delay systems is presented. The main results and proof are presented in details for the case of systems with multiple delays. The state of the art, ongoing…