相关论文: A Riemannian Inexact Newton Dogleg Method for Cons…
This paper is concerned with the nonnegative inverse eigenvalue problem of finding a nonnegative matrix such that its spectrum is the prescribed self-conjugate set of complex numbers. We first reformulate the nonnegative inverse eigenvalue…
In this paper, we consider the inverse eigenvalue problem for the positive doubly stochastic matrices, which aims to construct a positive doubly stochastic matrix from the prescribed realizable spectral data. By using the real Schur…
Inverse eigenvalue and singular value problems have been widely discussed for decades. The well-known result is the Weyl-Horn condition, which presents the relations between the eigenvalues and singular values of an arbitrary matrix. This…
In this paper we consider an inverse problem of determining a minimal surface embedded in a Riemannian manifold. We show under a topological condition that if $\Sigma$ is a $2$-dimensional embedded minimal surface, then the knowledge of the…
We consider the optimization problem with a generally quadratic matrix constraint of the form $X^TAX = J$, where $A$ is a given nonsingular, symmetric $n\times n$ matrix and $J$ is a given $k\times k$ symmetric matrix, with $k\leq n$,…
We consider the inverse problem of determining coefficients appearing in semilinear elliptic equations stated on Riemannian manifolds with boundary given the knowledge of the associated Dirichlet-to-Neumann map. We begin with a negative…
Solving the inverse kinematics problem is a fundamental challenge in motion planning, control, and calibration for articulated robots. Kinematic models for these robots are typically parametrized by joint angles, generating a complicated…
The study of solving the inverse eigenvalue problem for nonnegative matrices has been around for decades. It is clear that an inverse eigenvalue problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…
The convergence of inexact Newton methods is studied for solving generalized equations on Riemannian manifolds by using the metric regularity property, which is also explored. Under appropriate conditions and without any additional…
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…
We study the inverse problem of unique recovery of a complex-valued scalar function $V:\mathcal M \times \mathbb C\to \mathbb C$, defined over a smooth compact Riemannian manifold $(\mathcal M,g)$ with smooth boundary, given the Dirichlet…
This paper is concerned with the least squares inverse eigenvalue problem of reconstructing a linear parameterized real symmetric matrix from the prescribed partial eigenvalues in the sense of least squares, which was originally proposed by…
In this paper, we study the inverse boundary value problem for the wave equation with a view towards an explicit reconstruction procedure. We consider both the anisotropic problem where the unknown is a general Riemannian metric smoothly…
In this paper, we propose a new method that combines the inexact Newton method with a procedure to obtain a feasible inexact projection for solving constrained smooth and nonsmooth equations. The local convergence theorems are established…
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…
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…
We consider the inverse problem to determine a smooth compact Riemannian manifold with boundary $(M, g)$ from a restriction $\Lambda_{\Src, \Rec}$ of the Dirichlet-to-Neumann operator for the wave equation on the manifold. Here $\Src$ and…
A positive function (conductivity) on the edges of a graph induces the Dirichlet-to- Neumann map between boundary values of harmonic functions. The inverse conductivity problem is to find the conductivity from the Dirichlet-to-Neumann map.…
Riemannian submanifold optimization with momentum is computationally challenging because, to ensure that the iterates remain on the submanifold, we often need to solve difficult differential equations. Here, we simplify such difficulties…
We consider the inverse problem of determining a potential in a semilinear elliptic equation from the knowledge of the Dirichlet-to-Neumann map. For bounded Euclidean domains we prove that the potential is uniquely determined by the…