Related papers: Optimization on the symplectic group

In this paper we consider the ``symplectic'' version of the Euler equations studied by Ebin \cite{ebin}. We show that these equations are globally well-posed on the Sobolev space $H^s(\mathbb{R}^{2n})$ for $n \geq 1$ and $s > 2n/2+1$. The…

Let C be the class of compact 2n-dimensional symplectic manifolds M for which the first or (n-1) Chern class vanish. We point out an integer optimization problem to find a lower bound B(n) on the number of equilibrium points of…

$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…

We compare the performances of symplectic and non-symplectic integrators for the computation of normal geodesics and conjugate points in sub-Riemannian geometry at the example of the Martinet case. For this case study we consider first the…

Non-transitive subgroups of the orthogonal group play an important role in the non-Euclidean geometry. If $G$ is a closed subgroup in the orthogonal group such that the orbit of a single Euclidean unit vector does not cover the (Euclidean)…

We show that the symplectic reduction of the dynamics of $N$ point vortices on the plane by the special Euclidean group $\mathsf{SE}(2)$ yields a Lie--Poisson equation for relative configurations of the vortices. Specifically, we combine…

Relative equilibria of Lagrangian and Hamiltonian systems with symmetry are critical points of appropriate scalar functions parametrized by the Lie algebra (or its dual) of the symmetry group. Setting aside the structures - symplectic,…

Unconstrained optimization problems become more common in scientific computing and engineering applications with the rapid development of artificial intelligence, and numerical methods for solving them more quickly and efficiently have been…

This paper aims to focus on Richardson varieties on symplectic groups, especially their combinatorial characterization and defining equations. Schubert varieties and opposite Schubert varieties have profound significance in the study of…

This work presents two novel approaches for the symplectic model reduction of high-dimensional Hamiltonian systems using data-driven quadratic manifolds. Classical symplectic model reduction approaches employ linear symplectic subspaces for…

The problem of computing the global minimum of a trigonometric polynomial is computationally hard. We address this problem for the case, where the polynomial is invariant under the exponential action of a finite group. The strategy is to…

The aim of this work is to study, from an intrinsic and geometric point of view, second-order constrained variational problems on Lie algebroids, that is, optimization problems defined by a cost functional which depends on higher-order…

In the recent years, considerable attention has been paid to preserving structures and invariants in reduced basis methods, in order to enhance the stability and robustness of the reduced system. In the context of Hamiltonian systems,…

This paper deals with an optimization problem over a network of agents, where the cost function is the sum of the individual objectives of the agents and the constraint set is the intersection of local constraints. Most existing methods…

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

For $(\mathbb{C} P^2 \# 5{\overline {\mathbb{C} P^2}},\omega)$, let $N_{\omega}$ be the number of $(-2)$-symplectic spherical homology classes.We completely determine the Torelli symplectic mapping class group (Torelli SMCG): the Torelli…

This work proposes an implementable proximal-type method for a broad class of optimization problems involving nonsmooth and nonconvex objective and constraint functions. In contrast to existing methods that rely on an ad hoc model…

In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…

Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence…

This paper formulates the problem of Extremum Seeking for optimization of cost functions defined on Riemannian manifolds. We extend the conventional extremum seeking algorithms for optimization problems in Euclidean spaces to optimization…