相关论文: A coordinate-free condition number for convex prog…

In the context of mathematical cosmology, the study of necessary and sufficient conditions for a semi-Riemannian manifold to be a (generalised) Robertson-Walker space-time is important. In particular, it is a requirement for the development…

The constrained gradient method (CGM) has recently been proposed to solve convex optimization and monotone variational inequality (VI) problems with general functional constraints. While existing literature has established convergence…

The constant rank constraint qualification (CRCQ) for second-order cone programs, introduced by Andreani et al. in [Math. Program. 202 (2023), 473 - 513], shares some desirable properties with its classical nonlinear programming…

We propose a stochastic conditional gradient method (CGM) for minimizing convex finite-sum objectives formed as a sum of smooth and non-smooth terms. Existing CGM variants for this template either suffer from slow convergence rates, or…

We study the rigidity properties of Grassmannian frames: basis-like sets of unit vectors that correspond to optimal Grassmannian line packings. It is known that Grassmannian frames characterized by the Welch bound must satisfy the…

Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…

In this paper, we study Riemannian zeroth-order optimization in settings where the underlying Riemannian metric $g$ is geodesically incomplete, and the goal is to approximate stationary points with respect to this incomplete metric. To…

The classical convex feasibility problem in a finite dimensional Euclidean space is studied in the present paper. We are interested in two cases. First, we assume to know how to compute an exact project onto one of the sets involved and the…

Symmetry and antisymmetry are fundamental concepts in many strict sciences. Pairwise comparisons (PC) matrices are fundamental tools for representing pairwise relations in decision making. In this theoretical study, we present a novel…

Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…

Let $(\mathcal{M},g)$ be a Riemannian manifold and $\mathcal{N}$ a $\mathcal{C}^2$ submanifold without boundary. If we multiply the metric $g$ by the inverse of the squared distance to $\mathcal{N}$, we obtain a new metric structure on…

We consider the quadratic optimization problem $$F_n^{W,h}:= \sup_{x \in S^{n-1}} ( x^T W x/2 + h^T x )\,, $$ with $W$ a (random) matrix and $h$ a random external field. We study the probabilities of large deviation of $F_n^{W,h}$ for $h$ a…

This paper concerns parameterized convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional Banach (resp. finite-dimensional) spaces and that are indexed by an arbitrary fixed set T…

We study the convergence of the Riemannian steepest descent algorithm on the Grassmann manifold for minimizing the block version of the Rayleigh quotient of a symmetric matrix. Even though this problem is non-convex in the Euclidean sense…

The Wiener index $W(G)$ of a graph $G$ is one of the most well-known topological indices, which is defined as the sum of distances between all pairs of vertices of $G$. The diameter $D(G)$ of $G$ is the maximum distance between all pairs of…

We show that in the analytic category, given a Riemannian metric $g$ on a hypersurface $M\subset \Z$ and a symmetric tensor $W$ on $M$, the metric $g$ can be locally extended to a Riemannian Einstein metric on $Z$ with second fundamental…

We examine questions of geometric realizability for algebraic structures which arise naturally in affine and Riemannian geometry. Suppose given an algebraic curvature operator R at a point P of a manifold M and suppose given a real analytic…

We develop new techniques in order to deal with Riccati-type equations, subject to a further algebraic constraint, on Riemannian manifolds $(M^3,g)$. We find that the obstruction to solve the aforementioned equation has order $4$ in the…

We give a general Lagrange multiplier rule for mathematical programming problems in a Hausdorff locally convex space. We consider infinitely many inequality and equality constraints. Our results gives in particular a generalisation of the…

The main constraint on relative position of geometric objects, used in spatial planning for computing the C-space maps (for example, in robotics, CAD, and packaging), is the relative non-overlapping of objects. This is the simplest…