Related papers: Persistency of Linear Programming Relaxations for …

In this paper, we study local regularity properties of minimizers of nonlocal variational functionals with variable exponents and weak solutions to the corresponding Euler--Lagrange equations. We show that weak solutions are locally bounded…

Estimation of nonlinear dynamic models from data poses many challenges, including model instability and non-convexity of long-term simulation fidelity. Recently Lagrangian relaxation has been proposed as a method to approximate simulation…

We consider a random network of nonlinear maps exhibiting a wide range of local dynamics, with the links having normally distributed interaction strengths. The stability of such a system is examined in terms of the asymptotic fraction of…

This paper investigates two issues on identification of switched linear systems: persistence of excitation and numerical algorithms. The main contribution is a much weaker condition on the regressor to be persistently exciting that…

In this paper we present a rigorous modulational stability theory for periodic traveling wave solutions to equations of nonlinear Schr\"odinger (NLS) type. We first argue that, for Hamiltonian dispersive equations with a non-singular…

In this article, we show that each semidefinite relaxation of a ball-constrained noncommutative polynomial optimization problem can be cast as a semidefinite program with a constant trace matrix variable. We then demonstrate how this…

The persistence theory has been employed by several authors in order to study persistence properties of dynamical systems generated by ordinary differential equations or maps across diverse disciplines. In this note, the author discusses a…

While decomposition of one-parameter persistence modules behaves nicely, as demonstrated by the algebraic stability theorem, decomposition of multiparameter modules is known to be unstable in a certain precise sense. Until now, it has not…

This paper studies the problem of stability of a parameterized delay differential equations (DDE see equation (0.1)). After discretizing the DDE (0.1), we show that the problem can be equivalently casted into a semi-definite programming…

We consider the problem of constructing Lyapunov functions for linear differential equations with delays. For such systems it is known that exponential stability implies the existence of a positive Lyapunov function which is quadratic on…

Self-stabilization is a strong property that guarantees that a network always resume correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic…

Performative prediction is a framework for learning models that influence the data they intend to predict. We focus on finding classifiers that are performatively stable, i.e. optimal for the data distribution they induce. Standard…

Conditions are established under which the optimal control of processes having both absolutely continuous and singular (with respect to time) controls are equivalent to linear programs over a space of measures on the state and control…

We establish existence, uniqueness and optimal regularity results for very weak solutions to certain nonlinear elliptic boundary value problems. We introduce structural asymptotic assumptions of Uhlenbeck type on the nonlinearity, which are…

Recently, Popa and Rasa [18,19] have shown the (in)stability of some classical operators defined on [0,1] and found best constant when the positive linear operators are stable in the sense of Hyers-Ulam. In this paper we show Hyers-Ulam…

In optimal transport, quadratic regularization is a sparse alternative to entropic regularization: the solution measure tends to have small support. Computational experience suggests that the support decreases monotonically to the…

Sequential lateration is a class of methods for multidimensional scaling where a suitable subset of nodes is first embedded by some method, e.g., a clique embedded by classical scaling, and then the remaining nodes are recursively embedded…

The stability of the recently discovered compacton solutions is studied by means of both linear stability analysis as well as Lyapunov stability criteria. From the results obtained it follows that, unlike solitons, all the allowed compacton…

This paper investigates the robustness of the Lur'e problem under positivity constraints, drawing on results from the positive Aizerman conjecture and robustness properties of Metzler matrices. Specifically, we consider a control system of…

We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley [GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…