Related papers: Semi-Riemannian Manifold Optimization

Riemannian meta-optimization provides a promising approach to solving non-linear constrained optimization problems, which trains neural networks as optimizers to perform optimization on Riemannian manifolds. However, existing Riemannian…

In scientific computing and machine learning applications, matrices and more general multidimensional arrays (tensors) can often be approximated with the help of low-rank decompositions. Since matrices and tensors of fixed rank form smooth…

As a generalization of anti-invariant Riemannian submersions, we introduce anti-invariant Riemannian maps from almost Hermitian manifolds to Riemannian manifolds. We give examples and investigate the geometry of foliations which are arisen…

Noting that the complete lift of a Rimannian metric defined on a differentiable manifold is not 0-homogeneous on the fibers of the tangent bundle . In this paper we introduce a new lift which is 0-homogeneous. It determines on slit tangent…

The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space and on scalability to high-dimensional problems. The…

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…

We consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in Euclidean space, where the task is to solve Riemannian optimization problem with only noisy objective function evaluations. Towards this, our main…

We discover a fundamental exterior differential system of Riemannian geometry; indeed, an intrinsic and invariant global system of differential forms of degree $n$ associated to any given oriented Riemannian manifold $M$ of dimension $n+1$.…

We consider a generalization of Riemannian geometry that naturally arises in the framework of control theory. Let $X$ and $Y$ be two smooth vector fields on a two-dimensional manifold $M$. If $X$ and $Y$ are everywhere linearly independent,…

Convex optimization is a vibrant and successful area due to the existence of a variety of efficient algorithms that leverage the rich structure provided by convexity. Convexity of a smooth set or a function in a Euclidean space is defined…

In this paper, we introduce the notion of generalized $\epsilon$-stationarity for a class of nonconvex and nonsmooth composite minimization problems on compact Riemannian submanifold embedded in Euclidean space. To find a generalized…

This research work introduces the structure of invariant and screen semi-invariant lightlike submanifolds of a metallic semi-Riemannian manifold with a quarter symmetric non-metric connection, elaborated with examples. It delves into the…

We consider discretized two-dimensional PDE-constrained shape optimization problems, in which shapes are represented by triangular meshes. Given the connectivity, the space of admissible vertex positions was recently identified to be a…

We examine a wide class of stochastic approximation algorithms for solving (stochastic) nonlinear problems on Riemannian manifolds. Such algorithms arise naturally in the study of Riemannian optimization, game theory and optimal transport,…

Let M be either a simply connected pseudo-Riemannian space of constant curvature or a rank one Riemannian symmetric space (other than the octonion hyperbolic plane), and consider the space L(M) of oriented geodesics of M. The space L(M) is…

Low-rank optimization problems with sparse simplex constraints involve variables that must satisfy nonnegativity, sparsity, and sum-to-1 conditions, making their optimization particularly challenging due to the interplay between low-rank…

We consider a class of Riemannian optimization problems where the objective is the sum of a smooth function and a nonsmooth function, considered in the ambient space. This class of problems finds important applications in machine learning…

This paper proposes a Riemannian Multiobjective Proximal Gradient Method (RMPGM) for composite optimization problems on manifolds. Unlike scalarization-based approaches, the proposed framework directly handles vector-valued objectives and…

Within a framework of noncommutative geometry, we develop an analogue of (pseudo) Riemannian geometry on finite and discrete sets. On a finite set, there is a counterpart of the continuum metric tensor with a simple geometric…

Symmetric Positive Definite (SPD) matrices have become popular to encode image information. Accounting for the geometry of the Riemannian manifold of SPD matrices has proven key to the success of many algorithms. However, most existing…