相关论文: Least-Squares on the Real Symplectic Group

We investigate the minimization of a quadratic function over Stiefel manifolds (the set of all orthogonal $r$- frames in $\mathbf{R}^n$), which has applications in high-dimensional semi-supervised classification tasks. To reduce the…

Let us call pseudo-homothetic group the non-unimodular 3-dimensional Lie group that is the semi-direct product of $\mathbb{R}$ acting non-semisimply on $\mathbb{R}^2$. In this article, we solve the geodesic completeness problem on this Lie…

This article introduces two reduction schemes for Hamiltonian systems on an exact symplectic manifold admitting Lie group symmetries. It is demonstrated that these reduction procedures are equivalent by employing a modified…

The least squares method provides the best-fit curve by minimizing the total squares error. In this work, we provide the modified least squares method based on the fractional orthogonal polynomials that belong to the space $M_{n}^{\lambda}…

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 paper proposes an original Riemmanian geometry for low-rank structured elliptical models, i.e., when samples are elliptically distributed with a covariance matrix that has a low-rank plus identity structure. The considered geometry is…

In this paper, we study the computational complexity of finding the \emph{geodetic number} of graphs. A set of vertices $S$ of a graph $G$ is a \emph{geodetic set} if any vertex of $G$ lies in some shortest path between some pair of…

Geodesics on Riemannian manifolds are precisely the locally length-minimizing curves, but their explicit description via simple functions is rarely possible. Geodesics of the simplest form, such as lines on Euclidean space and great circles…

The degree-$4$ Sum-of-Squares (SoS) SDP relaxation is a powerful algorithm that captures the best known polynomial time algorithms for a broad range of problems including MaxCut, Sparsest Cut, all MaxCSPs and tensor PCA. Despite being an…

We provide a new branching rule from the general linear group $GL_{2n}(\mathbb{C})$ to the symplectic group $Sp_{2n}(\mathbb{C})$ by establishing a simple algorithm which gives rise to a bijection from the set of semistandard tableaux of a…

This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods…

The paper studies a geometrically robust least-squares problem that extends classical and norm-based robust formulations. Rather than minimizing residual error for fixed or perturbed data, we interpret least-squares as enforcing approximate…

A minimal geodesic on a Riemannian manifold is a geodesic defined on $\mathbb{R}$ that lifts to a globally distance minimizing curve on the universal covering. Bangert proved that there is a lower bound for the number of geometrically…

We focus on a class of non-smooth optimization problems over the Stiefel manifold in the decentralized setting, where a connected network of $n$ agents cooperatively minimize a finite-sum objective function with each component being weakly…

By elementary matrix algebra we show that every real $2n \times 2n$ matrix admits a dilation to an element of the real symplectic group $Sp (2(n+m))$ for some nonnegative integer $m.$ Our methods do not yield the minimum value of $m,$ for…

In this paper we prove new upper bounds for the length of a shortest closed geodesic, denoted $l(M)$, on a complete, non-compact Riemannian surface $M$ of finite area $A$. We will show that $l(M) \leq 4\sqrt{2A}$ on a manifold with one end,…

The present paper starts with an introduction to quaternions and then defines the 3-dimmensional sphere as the set of quaternions of length one. The quaternion group induces on $\mathbb{S}^3$ a structure of noncommutative Lie group. This…

In the Sparse Linear Regression (SLR) problem, given a $d \times n$ matrix $M$ and a $d$-dimensional query $q$, the goal is to compute a $k$-sparse $n$-dimensional vector $\tau$ such that the error $||M \tau-q||$ is minimized. This problem…

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…

Given a negatively curved geodesic metric space M, we study the asymptotic penetration behaviour of geodesic lines of M in small neighbourhoods of closed geodesics and of other compact convex subsets of M. We define a spiraling spectrum…