Related papers: Symplectic eigenvalue problem via trace minimizati…

A symplectic semitoric manifold is a symplectic $4$-manifold endowed with a Hamiltonian $(S^1 \times \mathbb{R})$-action satisfying certain conditions. The goal of this paper is to construct a new symplectic invariant of symplectic…

Riemannian submanifold optimization with momentum is computationally challenging because, to ensure that the iterates remain on the submanifold, we often need to solve difficult differential equations. Here, we simplify such difficulties…

We study the properties of stochastic approximation applied to a tame nondifferentiable function subject to constraints defined by a Riemannian manifold. The objective landscape of tame functions, arising in o-minimal topology extended to a…

If $A$ is a $2n \times 2n$ real positive definite matrix, then there exists a symplectic matrix $M$ such that $M^TAM = \left [ \begin{array}{cc} D & O \\ O & D \end{array} \right ]$ where $D= \diag (d_1 (A), \ldots, d_n(A))$ is a diagonal…

We consider the minimization or maximization of the $J$th largest eigenvalue of an analytic and Hermitian matrix-valued function, and build on Mengi et al. (2014, SIAM J. Matrix Anal. Appl., 35, 699-724). This work addresses the setting…

The computation of eigenvalues of large-scale matrices arising from finite element discretizations has gained significant interest in the last decade. Here we present a new algorithm based on slicing the spectrum that takes advantage of the…

We generalize various symplectic reduction techniques to the context of the optimal momentum map. Our approach allows the construction of symplectic point and orbit reduced spaces purely within the Poisson category under hypotheses that do…

This paper is essentially devoted to the study of the minimal eigenvalue $\lambda_{N,\alpha}$ of the Toepllitz matrice $T_N(\varphi_{\alpha})$ where $\varphi_{\alpha}(e^{i \theta})=|1- e^{i \theta} |^{2\alpha} c_{1}(e^{i \theta})$ with…

Eigenvalue estimates that are optimal in some sense have self-evident appeal and leave estimators with a sense of virtue and economy. So, it is natural that ongoing searches for effective strategies for difficult tasks such as estimating…

We propose a new Riemannian geometry for fixed-rank matrices that is specifically tailored to the low-rank matrix completion problem. Exploiting the degree of freedom of a quotient space, we tune the metric on our search space to the…

Obtaining solutions to Optimal Transportation (OT) problems is typically intractable when the marginal spaces are continuous. Recent research has focused on approximating continuous solutions with discretization methods based on i.i.d.…

For optimization problems on Riemannian manifolds, many types of globally convergent algorithms have been proposed, and they are often equipped with the Riemannian version of the Armijo line search for global convergence. Such existing…

A two dimensional eigenvalue problem (2DEVP) of a Hermitian matrix pair $(A, C)$ is introduced in this paper. The 2DEVP can be viewed as a linear algebraic formulation of the well-known eigenvalue optimization problem of the parameter…

We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…

This paper studies sufficient conditions in a variational obstacle avoidance problem on complete Riemannian manifolds. That is, we minimize an action functional, among a set of admissible curves, which depends on an artificial potential…

The problem of determining the configuration of points from partial distance information, known as the Euclidean Distance Geometry (EDG) problem, is fundamental to many tasks in the applied sciences. In this paper, we propose two algorithms…

This paper proposes a general framework of Riemannian adaptive optimization methods. The framework encapsulates several stochastic optimization algorithms on Riemannian manifolds and incorporates the mini-batch strategy that is often used…

We consider Riemannian inequality-constrained optimization problems. Such problems inherit the benefits of Riemannian approach developed in the unconstrained setting and naturally arise from applications in control, machine learning, and…

We present numerical minimizers for the first seven eigenvalues of the magnetic Dirichlet Laplacian with constant magnetic field in a wide range of field strengths. Adapting an approach by Antunes and Freitas, we use gradient descent for…

We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…