Related papers: Verification of some functional inequalities via p…
Lyapunov functions play a fundamental role in analyzing the stability and convergence properties of optimization methods. In this paper, we propose a novel and straightforward approach for constructing Lyapunov functions for first-order…
In this paper, we propose a new convex approach to stability analysis of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the…
We investigate the formal synthesis of global polynomial Lyapunov functions for polynomial vector fields. We establish that a sign-definite polynomial must satisfy specific algebraic constraints, which we leverage to develop a set of…
We study the existence and non-existence of classical solutions for inequalities of type $$ \pm \Delta^m u \geq \big(\Psi(|x|)*u^p\big)u^q \quad\mbox{ in } {\mathbb R}^N (N\geq 1). $$ Here, $\Delta^m$ $(m\geq 1)$ is the polyharmonic…
This paper studies the input-to-state stability (ISS) properties based on the method of Lyapunov functionals for a class of semi-linear parabolic partial differential equations (PDEs) with respect to boundary disturbances. In order to avoid…
We study symmetries enjoyed by the polynomials enumerating non-degenerate flags in finite vector spaces, equipped with a non-degenerate alternating bilinear, hermitian or quadratic form. To this end we introduce Igusa-type rational…
We introduce a new technique to optimize a linear cost function subject to a one-dimensional affine homogeneous quadratic integral inequality, i.e., the requirement that a homogeneous quadratic integral functional, affine in the…
Khasminski's \cite{chas1980stochastic} showed that many of the asymptotic stability and the integrability properties of the solutions to the Stochastic Differential Equations (SDEs) can be obtained using Lyapunov functions techniques. These…
We propose a methodology to address two analysis problems concerning complex systems, namely bounding state functionals of stochastic differential equations (SDEs) and verifying set avoidance of systems described by partial differential…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by…
We study the inequalities of the type $|\int_{\mathbb{R}^d} \Phi(K*f)| \lesssim \|f\|_{L_1(\mathbb{R}^d)}^p$, where the kernel $K$ is homogeneous of order $\alpha - d$ and possibly vector-valued, the function $\Phi$ is positively…
This paper is a follow up to an article by two of the authors dedicated to the study of Poincar\'e and logarithmic Sobolev inequalities for measures of the form $d\mu = e^{-U} d\nu$ where $e^{-U}$ is seen as a perturbation of $d\nu$.…
Polyhedral Lyapunov functions can approximate any norm arbitrarily well. Because of this, they are used to study the stability of linear time varying and linear parameter varying systems without being conservative. However, the…
Iterative gradient-based optimization algorithms are widely used to solve difficult or large-scale optimization problems. There are many algorithms to choose from, such as gradient descent and its accelerated variants such as Polyak's Heavy…
This paper presents numerical methods for computing regions of finite-time invariance (funnels) around solutions of polynomial differential equations. First, we present a method which exactly certifies sufficient conditions for invariance…
Performance analysis for linear time-invariant (LTI) systems has been closely tied to quadratic Lyapunov functions ever since it was shown that LTI system stability is equivalent to the existence of such a Lyapunov function. Some metrics…
In this article we consider a method of proving a class of inequalities of the form (1). The method is based on the precise approximations of the sine and cosine functions by Maclaurin polynomials of given order. By using this method we…
We consider the inverse optimization problem associated with the polynomial program f^*=\min \{f(x): x\in K\}$ and a given current feasible solution $y\in K$. We provide a systematic numerical scheme to compute an inverse optimal solution.…
In this paper we develop a general theoretical tool for the establishment of the boundedness of notoriously difficult operators (such as potentials) on certain specific types of rearrangement-invariant function spaces from analogous…