Related papers: The condition number of Riemannian approximation p…
We propose a novel Riemannian method for solving the Extreme multi-label classification problem that exploits the geometric structure of the sparse low-dimensional local embedding models. A constrained optimization problem is formulated as…
The paper presents analytic expressions of minimax (worst-case) estimates for solutions of linear abstract Neumann problems in Hilbert space with uncertain (not necessarily bounded!) inputs and boundary conditions given incomplete…
We consider the inverse problem for the wave equation on a compact Riemannian manifold or on a bounded domain of $\R^n$, and generalize the concept of {\em domain of influence}. We present an efficient minimization algorithm to compute the…
We use the method of higher order linearization to study an inverse boundary value problem for the minimal surface equation on a Riemannian manifold $(\mathbb{R}^n,g)$, where the metric $g$ is conformally Euclidean. In particular we show…
In this paper, we investigate the multi-objective optimal control problem of ordinary differential equations on Riemannian manifolds. We first obtain the second-order necessary conditions for weak Pareto optimal solutions for…
Numerous dimensionality reduction problems in data analysis involve the recovery of low-dimensional models or the learning of manifolds underlying sets of data. Many manifold learning methods require the estimation of the tangent space of…
In this work, we present a novel approach for solving stochastic shape optimization problems. Our method is the extension of the classical stochastic gradient method to infinite-dimensional shape manifolds. We prove convergence of the…
Constrained optimization plays a crucial role in the fields of quantum physics and quantum information science and becomes especially challenging for high-dimensional complex structure problems. One specific issue is that of quantum process…
This paper studies large-scale optimization problems on Riemannian manifolds whose objective function is a finite sum of negative log-probability losses. Such problems arise in various machine learning and signal processing applications. By…
We study a class of design problems in solid mechanics, leading to a variation on the classical question of equi-dimensional embeddability of Riemannian manifolds. In this general new context, we derive a necessary and sufficient existence…
In this paper, we study closed embedded minimal hypersurfaces in a Riemannian $(n+1)$-manifold ($2\le n\le 6$) that minimize area among such hypersurfaces. We show they exist and arise either by minimization techniques or by min-max…
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…
This paper studies a variational obstacle avoidance problem on complete Riemannian manifolds. That is, we minimize an action functional, among a set of admissible curves, which depends on an artificial potential function used to avoid…
In this article we extend the computational geometric curve reconstruction approach to curves in Riemannian manifolds. We prove that the minimal spanning tree, given a sufficiently dense sample, correctly reconstructs the smooth arcs and…
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…
Several important algorithms for machine learning and data analysis use pairwise distances as input. On Riemannian manifolds these distances may be prohibitively costly to compute, in particular for large datasets. To tackle this problem,…
Ill-posed linear inverse problems appear frequently in various signal processing applications. It can be very useful to have theoretical characterizations that quantify the level of ill-posedness for a given inverse problem and the degree…
Large-scale optimization problems arising from the discretization of problems involving PDEs sometimes admit solutions that can be well approximated by low-rank matrices. In this paper, we will exploit this low-rank approximation property…
We study variational obstacle avoidance problems on complete Riemannian manifolds and apply the results to the construction of piecewise smooth curves interpolating a set of knot points in systems with impulse effects. We derive the…
A computer-assisted proof is proposed for the Laplacian eigenvalue minimization problems over triangular domains under diameter constraints. The proof utilizes recently developed guaranteed computation methods for both eigenvalues and…