English
Related papers

Related papers: The Maximal Positively Invariant Set: Polynomial S…

200 papers

The paper is devoted to a systematic study and characterizations of notions of local maximal monotonicity and their strong counterparts for set-valued operators that appear in variational analysis, optimization, and their applications. We…

Optimization and Control · Mathematics 2023-08-29 Pham Duy Khanh , Vu Vinh Huy Khoa , Boris S. Mordukhovich , Vo Thanh Phat

For a (not necessarily locally convex) topological vector space $\mathcal{X}$ of holomorphic functions in one complex variable, we show that the shift invariant subspace generated by a set of polynomials is $\mathcal{X}$ if and only if…

Complex Variables · Mathematics 2025-12-02 Mikhail Mironov , Jeet Sampat

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

Discrete Mathematics · Computer Science 2026-04-10 Antonio E. Porreca , Marius Rolland

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

Numerical Analysis · Mathematics 2025-01-22 Leokadia Bialas-Ciez , Agnieszka Kowalska , Alvise Sommariva

The task of maximizing a monotone submodular function under a cardinality constraint is at the core of many machine learning and data mining applications, including data summarization, sparse regression and coverage problems. We study this…

Data Structures and Algorithms · Computer Science 2023-05-26 Silvio Lattanzi , Slobodan Mitrović , Ashkan Norouzi-Fard , Jakub Tarnawski , Morteza Zadimoghaddam

We consider the problem of approximating numerically the moments and the supports of measures which are invariant with respect to the dynamics of continuous- and discrete-time polynomial systems, under semialgebraic set constraints. First,…

Dynamical Systems · Mathematics 2018-07-03 Victor Magron , Marcelo Forets , Didier Henrion

We approximate the backward reachable set of discrete-time autonomous polynomial systems using the recently developed occupation measure approach. We formulate the problem as an infinite-dimensional linear programming (LP) problem on…

Systems and Control · Computer Science 2018-07-27 Weiqiao Han , Russ Tedrake

We study the problem of optimal subset selection from a set of correlated random variables. In particular, we consider the associated combinatorial optimization problem of maximizing the determinant of a symmetric positive definite matrix…

Computation · Statistics 2019-07-12 Yu Wang , Nhu D. Le , James V. Zidek

Given a max-plus linear system and a semimodule, the problem of computing the maximal controlled invariant subsemimodule is still open to this day. In this paper, we consider this problem for the specific class of fully actuated systems and…

Optimization and Control · Mathematics 2026-02-10 Davide Zorzenon , Jörg Raisch

We study nonstationary dynamical systems formed by sequential concatenation of nonuniformly expanding maps with a uniformly expanding first return map. Assuming a polynomially decaying upper bound on the tails of first return times that is…

Dynamical Systems · Mathematics 2025-09-22 A. Korepanov , J. Leppänen

This paper presents a method to approximately solve stochastic optimal control problems in which the cost function and the system dynamics are polynomial. For stochastic systems with polynomial dynamics, the moments of the state can be…

Optimization and Control · Mathematics 2017-02-24 Andrew Lamperski , Khem Raj Ghusinga , Abhyudai Singh

Non-positive, Markovian semigroups are sometimes used to describe the time evolution of subsystems immersed in an external environment. A widely adopted prescription to avoid the appearance of negative probabilities is to eliminate from the…

Quantum Physics · Physics 2007-05-23 F. Benatti , R. Floreanini

We consider impulsive dynamical systems defined on compact metric spaces and their respective impulsive semiflows. We establish sufficient conditions for the existence of probability measures which are invariant by such impulsive semiflows.…

Dynamical Systems · Mathematics 2015-06-19 Jose F. Alves , Maria Carvalho

We characterize and compute the maximal admissible positively invariant set for asymptotically stable constrained switching linear systems. Motivated by practical problems found, e.g., in obstacle avoidance, power electronics and nonlinear…

Dynamical Systems · Mathematics 2015-11-27 Nikolaos Athanasopoulos , Raphaël M. Jungers

We study an ancient problem that in a static or dynamical system, sought an optimal path, which the context always means within an extremal condition. In fact, through those discussions about this theme, we established a universal essential…

Data Structures and Algorithms · Computer Science 2016-02-09 Yong Tan

We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…

Probability · Mathematics 2025-10-21 Hongjian Wang , Aaditya Ramdas

This paper is devoted to study a characterization of (strong) local maximal monotonicity in terms of a property involving the graphical derivative of a set-valued mapping defined on a Hilbert space. As a consequence, a second-order…

Optimization and Control · Mathematics 2025-08-29 Juan Guillermo Garrido

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

Classical Analysis and ODEs · Mathematics 2023-10-30 Alexander Belton , Dominique Guillot , Apoorva Khare , Mihai Putinar

Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…

Machine Learning · Computer Science 2016-02-24 Francis Bach

We study the transport properties of nonautonomous chaotic dynamical systems over a finite time duration. We are particularly interested in those regions that remain coherent and relatively non-dispersive over finite periods of time,…

Dynamical Systems · Mathematics 2015-05-19 Gary Froyland , Naratip Santitissadeekorn , Adam Monahan