Related papers: Optimization on the symplectic group

The 2-opt heuristic is a simple local search heuristic for the Travelling Salesperson Problem (TSP). Although it usually performs well in practice, its worst-case running time is poor. Attempts to reconcile this difference have used…

In this paper we study a sub-Finsler geometric problem on the free-nilpotent group of rank 2 and step 3. Such a group is also called Cartan group and has a natural structure of Carnot group, which we metrize considering the $\ell_\infty$…

The Moment/Sum-of-squares hierarchy provides a way to compute the global minimizers of polynomial optimization problems (POP), at the cost of solving a sequence of increasingly large semidefinite programs (SDPs). We consider large-scale…

In non-smooth stochastic optimization, we establish the non-convergence of the stochastic subgradient descent (SGD) to the critical points recently called active strict saddles by Davis and Drusvyatskiy. Such points lie on a manifold $M$…

Various tasks in scientific computing can be modeled as an optimization problem on the indefinite Stiefel manifold. We address this using the Riemannian approach, which basically consists of equipping the feasible set with a Riemannian…

In this paper, we introduce some new iterative optimisation algorithms on Riemannian manifolds and Hilbert spaces which have good global convergence guarantees to local minima. More precisely, these algorithms have the following properties:…

Let $G$ be a finite group acting on a vector space $V = \mathbb{F}_p^n$ over a prime field. Given finite sets $S \subset G$ and $E \subset V$, we study the restricted orbit union $S(E) = \bigcup_{g\in S} g(E)$ and establish quantitative…

We study the sub-Riemannian structure determined by a left-invariant distribution of rank 2 on a step 3 Carnot group of dimension 5. We prove the conjectured cut times of Y. Sachkov for the sub-Riemannian Cartan problem. Along the proof, we…

The Hamiltonian Monte Carlo method generates samples by introducing a mechanical system that explores the target density. For distributions on manifolds it is not always simple to perform the mechanics as a result of the lack of global…

In this paper we compute the homotopy groups of the symplectomorphism groups of the 3-, 4- and 5-point blow-ups of the projective plane (considered as monotone symplectic Del Pezzo surfaces). Along the way, we need to compute the homotopy…

The Lie subgroup ${\rm GL}^{+}(2,\mathbb{C})$ of all matrices in the Lie group ${\rm GL}(2,\mathbb{C})$ with positive real determinant is equipped with a left-invariant sub-Lorentzian (anti)metric defined by the natural structure of the…

We investigate the complexity and approximability of the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value…

A new graph, called the symplectic inner product graph $Spi\big(2\nu,q\big)$, over a finite field $\mathbb{F}_q$ is introduced. We show that $Spi\big(2\nu,q\big)$ is connected with diameter $4$ if and only if $\nu\geq2$ and the automorphism…

In this paper, we study a retailer price optimization problem which includes the practical constraints: maximum number of price changes and minimum amount of price change (if a change is recommended). We provide a closed-form formula for…

The main aim of this paper is the description of a large class of lattices in some nilpotent Lie groups, sometimes filiformes, carrying a flat left invariant linear connection anf often a left invariant symplectic form. As a consequence we…

We describe a reduction process for symplectic principal $\mathbb{R}$-bundles in the presence of a momentum map. This type of structures plays an important role in the geometric formulation of non-autonomous Hamiltonian systems. We apply…

We establish or refute the optimality of inexact second-order methods for unconstrained nonconvex optimization from the point of view of worst-case evaluation complexity, improving and generalizing the results of Cartis, Gould and Toint…

We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A $(2+\epsilon)$-approximation for all-pairs shortest paths in $O(\log^2{n} / \epsilon)$ rounds on unweighted…

For symplectic group actions which are not Hamiltonian there are two ways to define reduction. Firstly using the cylinder-valued momentum map and secondly lifting the action to any Hamiltonian cover (such as the universal cover), and then…

This is the third paper in our series of five in which we test the Master Constraint Programme for solving the Hamiltonian constraint in Loop Quantum Gravity. In this work we analyze models which, despite the fact that the phase space is…