Related papers: Symplectic Geometry of Constrained Optimization
1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…
Arguably, the two most popular accelerated or momentum-based optimization methods in machine learning are Nesterov's accelerated gradient and Polyaks's heavy ball, both corresponding to different discretizations of a particular second order…
Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…
We systematically explore a class of constrained optimization problems with linear objective function and constraints that are linear combinations of logarithms of the optimization variables. Such problems can be viewed as a generalization…
In this work, we consider constrained stochastic optimization problems under hidden convexity, i.e., those that admit a convex reformulation via non-linear (but invertible) map $c(\cdot)$. A number of non-convex problems ranging from…
Analogous to the sl(n) case, we address the computation of the index of seaweed subalgebras of sp(2n) by introducing graphical representations called symplectic meanders. Formulas for the algebra's index may be computed by counting the…
Symplectic maps can provide a straightforward and accurate way to visualize and quantify the dynamics of conservative systems with two degrees of freedom. These maps can be easily iterated from the simplest computers to obtain trajectories…
Compressive sensing (CS) reconstructs images from sub-Nyquist measurements by solving a sparsity-regularized inverse problem. Traditional CS solvers use iterative optimizers with hand crafted sparsifiers, while early data-driven methods…
We develop the deformation theory of symplectic foliations, i.e. regular foliations equipped with a leafwise symplectic form. The main result of this paper is that each symplectic foliation has an attached $L_\infty$-algebra controlling its…
In this work we bring together tools and ideology from two different fields, Symplectic Geometry and Asymptotic Geometric Analysis, to arrive at some new results. Our main result is a dimension-independent bound for the symplectic capacity…
We study the local symplectic algebra of curves. We use the method of algebraic restrictions to classify symplectic $W_8$ and $W_9$ singularities. We use discrete symplectic invariants to distinguish symplectic singularities of the curves.…
We investigate the tension between symplecticity and gauge covariance in classical Hamiltonian mechanics. The pursuit of manifest covariance over manifest symplecticity results in a unique geometric formulation. Firstly, covariant yet…
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…
We detect, by using symplectic topology, invariant measures with large rotation vectors for a class of Hamiltonian flows.
This manuscript describes in detail the symplectic sum formulas in Gromov-Witten theory and related topological and analytic issues. In particular, we analyze and compare two analytic approaches to these formulas. The Ionel-Parker formula…
In this work, we study convex bodies in $\RR^{2n}$ with the property that their mean width cannot be infinitesimally decreased by symplectomorphisms. The common theme of our results is that toric symmetry is a preferred feature of convex…
In this article, we introduce symplectic reduction in the framework of nonrational toric geometry. When we specialize to the rational case, we get symplectic reduction for the action of a general, not necessarily closed, Lie subgroup of the…
We present novel geometric numerical integrators for Hunter--Saxton-like equations by means of new multi-symplectic formulations and known Hamiltonian structures of the problems. We consider the Hunter--Saxton equation, the modified…
In symplectic topology one uses elliptic methods to prove rigidity results about symplectic manifolds and solutions of Hamiltonian equations on them, where the most basic example is given by geodesics on Riemannian manifolds. Harmonic maps…
We find that with uniform mesh, the numerical schemes derived from finite element method can keep a preserved symplectic structure in one-dimensional case and a preserved multisymplectic structure in two-dimentional case in certain discrete…