Related papers: Open Problem: Two Riddles in Heavy-Ball Dynamics
The problem of splitting effects by vertex angles is discussed for nonintegrable rational polygonal billiards. A statistical analysis of the decay dynamics in weakly open polygons is given through the orbit survival probability. Two…
We consider the periodic Manhattan lattice with alternating orientations going north-south and east-west. Place obstructions on vertices independently with probability $0<p<1$. A particle is moving on the edges with unit speed following the…
This work is devoted to further consideration of the Henon map with negative values of the shrinking parameter and the study of transient oscillations, multistability, and possible existence of hidden attractors. The computation of the…
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…
We use matrix iteration theory to characterize acceleration in smooth games. We define the spectral shape of a family of games as the set containing all eigenvalues of the Jacobians of standard gradient dynamics in the family. Shapes…
A perfectly elastic beam is situated on top of a two dimensional fluid canister. The beam is deforming in accordance to an interaction with a Navier-Stokes fluid. Hence a hyperbolic equation is coupled to the Navier-Stokes equation. The…
We examine the possible trajectories of a classical particle, trapped in a two-dimensional infinite rectangular well, using the Hamilton-Jacobi equation. We observe that three types of trajectories are possible: periodic orbits, open orbits…
We derive the equation of a free vibrating thin plate whose mass is concentrated at the boundary, namely a Steklov problem for the biharmonic operator. We provide Hadamard-type formulas for the shape derivatives of the corresponding…
This paper is concerned with boundary stabilization of two-dimensional hyperbolic systems of partial differential equations. By adapting the Lyapunov function previously proposed by the second author for linearized hyperbolic systems with…
A classic problem of the motion of a projectile thrown at an angle to the horizon in a medium with a quadratic resistance law is studied. An approximate analytical solution of the equations of projectile motion is presented, which has a…
In this paper, we study diagonal hyperbolic systems in one space dimension. Based on a new gradient entropy estimate, we prove the global existence of a continuous solution, for large and non-decreasing initial data. We remark that these…
For a given natural number $n$, the second part of Hilbert's 16th Problem asks whether there exists a finite upper bound for the maximum number of limit cycles that planar polynomial vector fields of degree $n$ can have. This maximum number…
We present a method for solving the general mixed constrained convex quadratic programming problem using an active set method on the dual problem. The approach is similar to existing active set methods, but we present a new way of solving…
We present two classes of differentially private optimization algorithms derived from the well-known accelerated first-order methods. The first algorithm is inspired by Polyak's heavy ball method and employs a smoothing approach to decrease…
This work presents a universal accelerated first-order primal-dual method for affinely constrained convex optimization problems. It can handle both Lipschitz and H\"{o}lder gradients but does not need to know the smoothness level of the…
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…
In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…
We construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an…
In smooth strongly convex optimization, knowledge of the strong convexity parameter is critical for obtaining simple methods with accelerated rates. In this work, we study a class of methods, based on Polyak steps, where this knowledge is…
In this short note, we consider the problem of solving a min-max zero-sum game. This problem has been extensively studied in the convex-concave regime where the global solution can be computed efficiently. Recently, there have also been…