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

There are many equivalent definitions of Riemannian geodesics. They are naturally generalised to sub-Riemannian manifold, but become non-equivalent. We give a review of different definitions of geodesics of a sub-Riemannian manifold and…

We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive…

Gradient descent methods are fundamental first-order optimization algorithms in both Euclidean spaces and Riemannian manifolds. However, the exact gradient is not readily available in many scenarios. This paper proposes a novel inexact…

Riemannian optimization uses local methods to solve optimization problems whose constraint set is a smooth manifold. A linear step along some descent direction usually leaves the constraints, and hence retraction maps are used to…

We study the problem of determining the least symmetric triangle, which arises both from pure geometry and from the study of molecular chirality in chemistry. Using the correspondence between planar $n$-gons and points in the Grassmannian…

In regression analysis for deriving scaling laws that occur in various scientific disciplines, usually standard regression methods have been applied, of which ordinary least squares (OLS) is the most popular. In many situations, the…

We propose a Randomised Subspace Gauss-Newton (R-SGN) algorithm for solving nonlinear least-squares optimization problems, that uses a sketched Jacobian of the residual in the variable domain and solves a reduced linear least-squares on…

We consider surfaces immersed in three-dimensional pseudohermitian manifolds. We define the notion of (p-)mean curvature and of the associated (p-)minimal surfaces, extending some concepts previously given for the (flat) Heisenberg group.…

Minimal surfaces in the Riemannian product of surfaces of constant curvature have been considered recently, particularly as these products arise as spaces of oriented geodesics of 3-dimensional space-forms. This papers considers more…

We classify the connected Lie subgroups of the symplectic group $Sp(2,\mathbb{R})$ whose elements are matrices in block lower triangular form. The classification is up to conjugation within $Sp(2,\mathbb{R})$. Their study is motivated by…

We develop a new least squares method for solving the second-order elliptic equations in non-divergence form. Two least-squares-type functionals are proposed for solving the equations in two steps. We first obtain a numerical approximation…

We present a new flexible wavefront propagation algorithm for the boundary value problem for sub-Riemannian (SR) geodesics in the roto-translation group $SE(2) = \mathbb{R}^2 \rtimes S^1$ with a metric tensor depending on a smooth external…

We classify up to conjugation by $\operatorname{GL}(2,\mathbb{R})$ (more precisely, block diagonal symplectic matrices) all the semidirect products inside the maximal parabolic of $\operatorname{Sp}(2,\mathbb{R})$ by means of an essentially…

We solve explicitly the geodesic equation for a wide class of (pseudo)-Riemannian homogeneous manifolds (G/H,m), including those with G compact, as well as non-compact semisimple Lie groups, under a simple algebraic condition for the metric…

The unit sphere $\mathbb S^3$ can be identified with the unitary group SU(2). Under this identification the unit sphere can be considered as a non-commutative Lie group. The commutation relations for the vector fields of the corresponding…

In this paper, we propose a new global analysis framework for a class of low-rank matrix recovery problems on the Riemannian manifold. We analyze the global behavior for the Riemannian optimization with random initialization. We use the…

In this paper, we study the problem of finding the least square solutions of over-determined linear algebraic equations over networks in a distributed manner. Each node has access to one of the linear equations and holds a dynamic state. We…

We study the complexity of finding the \emph{geodetic number} on subclasses of planar graphs and chordal graphs. A set $S$ of vertices of a graph $G$ is a \emph{geodetic set} if every vertex of $G$ lies in a shortest path between some pair…

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a…

This paper considers the problem of minimizing the summation of a differentiable function and a nonsmooth function on a Riemannian manifold. In recent years, proximal gradient method and its invariants have been generalized to the…