Related papers: On the Computational Complexity of Limit Cycles in…
Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagram (also termed as barcode). In our earlier work, we showed that computing…
This paper is devoted to study the limit cycle problem of a cubic reversible system with an isochronous center, when it is perturbed inside a class of polynomials. An upper bound of the number of limit cycles is obtained using the Abelian…
This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…
We show that, near periodic orbits, a class of hybrid models can be reduced to or approximated by smooth continuous-time dynamical systems. Specifically, near an exponentially stable periodic orbit undergoing isolated transitions in a…
We derive lower bounds on the black-box oracle complexity of large-scale smooth convex minimization problems, with emphasis on minimizing smooth (with Holder continuous, with a given exponent and constant, gradient) convex functions over…
We present a new simple method for rounding a semidefinite programming relaxation of a constraint satisfaction problem. We apply it to the problem of approximate angular synchronization. Specifically, we are given directed distances on a…
The fully discrete problem for convection-diffusion equation is considered. It comprises compact approximations for spatial discretization, and Crank-Nicolson scheme for temporal discretization. The expressions for the entries of inverse of…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
For periodic linear control systems with bounded control range, an autonomized system is introduced by adding the phase to the state of the system. Here a unique control set (i.e., a maximal set of approximate controllability) with nonvoid…
Approximate simulation, an extension of simulation relations from formal methods to continuous systems, is a powerful tool for hierarchical control of complex systems. Finding an approximate simulation relation between the full "concrete"…
We solve a randomized version of the following open question: is there a strictly convex, bounded curve \gamma in the plane such that the number of rational points on \gamma, with denominator $n$, approaches infinity with $n$? Although this…
We present a unified treatment of the abstract problem of finding the best approximation between a cone and spheres in the image of affine transformations. Prominent instances of this problem are phase retrieval and source localization. The…
For piecewise-smooth differential systems, in this paper we focus on crossing limit cycles and sliding loops bifurcating from a grazing loop connecting one high multiplicity tangent point. For the low multiplicity cases considered in…
We study the dynamics of iteration function systems generated by a pair of circle diffeomorphisms close to rotations in the $C^{1+\mathrm{bv}}$-topology. We characterize the obstruction to minimality and describe the limit set. In…
A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…
Equipping approximate dynamic programming (ADP) with inputconstraints has a tremendous significance. This enables ADP to be applied tothe systems with actuator limitations, which is quite common for dynamicalsystems. In a conventional…
In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…
We characterize the maximum controlled invariant (MCI) set for discrete- as well as continuous-time nonlinear dynamical systems as the solution of an infinite-dimensional linear programming problem. For systems with polynomial dynamics and…
We develop a new numerical method for approximating the infinite time reachable set of strictly stable linear control systems. By solving a linear program with a constraint that incorporates the system dynamics, we compute a polytope with…
We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…