Related papers: Grassmannian optimization is NP-hard

This paper presents and analyzes the first matrix optimization model which allows general coordinate and spectral constraints. The breadth of problems our model covers is exemplified by a lengthy list of examples from the literature,…

High-dimensional nonlinear optimization problems subject to nonlinear constraints can appear in several contexts including constrained physical and dynamical systems, statistical estimation, and other numerical models. Feasible optimization…

In recent years, interest in gradient-based optimization over Riemannian manifolds has surged. However, a significant challenge lies in the reliance on hyperparameters, especially the learning rate, which requires meticulous tuning by…

We study robust versions of properties of $(n,d,\lambda)$-graphs, namely, the property of a random sparsification of an $(n,d,\lambda)$-graph, where each edge is retained with probability $p$ independently. We prove such results for the…

We consider a class of (possibly strongly) geodesically convex optimization problems on Hadamard manifolds, where the objective function splits into the sum of a smooth and a possibly nonsmooth function. We introduce an intrinsic convex…

When $k|n$, the tree $\mathrm{Comb}_{n,k}$ consists of a path containing $n/k$ vertices, each of whose vertices has a disjoint path length $k-1$ beginning at it. We show that, for any $k=k(n)$ and $\epsilon>0$, the binomial random graph…

In this paper, we consider optimization problems over closed embedded submanifolds of $\mathbb{R}^n$, which are defined by the constraints $c(x) = 0$. We propose a class of constraint dissolving approaches for these Riemannian optimization…

In this paper, we introduce some new iterative optimisation algorithms on Riemannian manifolds and Hilbert spaces which have good global convergence guarantees to local minima. More precisely, these algorithms have the following properties:…

Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. This framework captures well…

We show NP-hardness of a generalized quadratic programming problem, which we called Unconstrained N-ary Quadratic Programming (UNQP). This problem has recently become practically relevant in the context of novel memristor-based neuromorphic…

In this paper we extend to non-compact Riemannian manifolds with boundary the use of two important tools in the geometric analysis of compact spaces, namely, the weak maximum principle for subharmonic functions and the integration by parts.…

In quantum field theory study, Grassmannian manifolds $\text{Gr}(4,n)$ are closely related to $D{=}4$ kinematics input for $n$-particle scattering processes, whose combinatorial and geometrical structures have been widely applied in…

We determine the Euclidean distance degrees of the three most common manifolds arising in manifold optimization: flag, Grassmann, and Stiefel manifolds. For the Grassmannian, we will also determine the Euclidean distance degree of an…

The isotropic Grassmannian parametrizes isotropic subspaces of a vector space equipped with a quadratic form. In this paper, we show that any maximal isotropic Grassmannian in its Pl\"ucker embedding can be defined by pulling back the…

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…

We propose a generalization of the Weierstrass iteration for over-constrained systems of equations and we prove that the proposed method is the Gauss-Newton iteration to find the nearest system which has at least $k$ common roots and which…

We study compact quotients of a Riemannian product $\mathbb{R}^q \times (N, g_N)$, where $(N, g_N)$ is a complete Riemannian manifold, by discrete subgroups $\Gamma$ of $\mathrm{Sim}(\mathbb{R}^q) \times \mathrm{Isom}(N)$. When $N$ is a…

This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of…

We consider the following geometric optimization problem: Given $ n $ axis-aligned rectangles in the plane, the goal is to find a set of horizontal segments of minimum total length such that each rectangle is stabbed. A segment stabs a…

The recovery of an unknown density matrix of large size requires huge computational resources. The recent Factored Gradient Descent (FGD) algorithm and its variants achieved state-of-the-art performance since they could mitigate the…