Related papers: Hessian Operators on Constraint Manifolds
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
The cost functions considered are $c(x,y)=h(x-y)$, where $h\in C^2(\mathbb{R}^n)$, homogeneous of degree $p\geq 2$, with a positive definite Hessian in the unit sphere. We study multivalued monotone maps with respect to that cost and…
We show that linearly constrained linear optimization over a Stiefel or Grassmann manifold is NP-hard in general. We show that the same is true for unconstrained quadratic optimization over a Stiefel manifold. We will show that unless…
Let $(X,\omega)$ be a compact Hermitian manifold of complex dimension $n$. In this paper we establish a Ko\l odziej-Nguyen type weak convergence theorem of complex Hessian operators. Utilizing this result, we prove a general mixed Hessian…
We establish higher-order weighted Sobolev and Holder regularity for solutions to variational equations defined by the elliptic Heston operator, a linear second-order degenerate-elliptic operator arising in mathematical finance.…
We reconsider the one-axis twisting Hamiltonian, which is commonly used for generating spin squeezing, and treat its dynamics within the Heisenberg operator approach. To this end we solve the underlying Heisenberg equations of motion…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
Algorithms for bilevel optimization often encounter Hessian computations, which are prohibitive in high dimensions. While recent works offer first-order methods for unconstrained bilevel problems, the constrained setting remains relatively…
We derive an a priori real Hessian estimate for solutions of a large family of geometric fully non-linear elliptic equations on compact Hermitian manifolds, which is independent of a lower bound for the right-hand side function. This…
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…
Finite-sum optimization problems are ubiquitous in machine learning, and are commonly solved using first-order methods which rely on gradient computations. Recently, there has been growing interest in \emph{second-order} methods, which rely…
A simple version of exact finite dimensional reduction for the variational setting of mechanical systems is presented. It is worked out by means of a thorough global version of the implicit function theorem for monotone operators. Moreover,…
Optimizing smooth convex functions in stochastic settings, where only noisy estimates of gradients and Hessians are available, is a fundamental problem in optimization. While first-order methods possess a low per-iteration cost, their…
Riemannian optimization uses local methods to solve optimization problems whose constraint set is a smooth manifold. A linear step along some descent direction usually leaves the constraints, and hence retraction maps are used to…
We consider Carleson-Sj\"{o}lin operators on Riemannian manifolds that arise naturally from the study of Bochner-Riesz problems on manifolds. They are special cases of H\"{o}rmander-type oscillatory integral operators. We obtain improved…
We present a new method to compute short-time expectation values in large collective spin systems with generic Markovian decoherence. Our method is based on a Taylor expansion of a formal solution to the equations of motion for Heisenberg…
We characterize the solutions of the Poisson equation and the domain of its associated one-sided Hilbert transform for Ces\`aro bounded operators of fractional order. The results obtained fairly generalize the corresponding ones for…
In this work, we generalize the probability simplex constraint to matrices, i.e., $\mathbf{X}_1 + \mathbf{X}_2 + \ldots + \mathbf{X}_K = \mathbf{I}$, where $\mathbf{X}_i \succeq 0$ is a symmetric positive semidefinite matrix of size…
In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…
Equations of Hammerstein type cover large variety of areas and are of much interest to a wide audience due to the fact that they have applications in numerous areas. Suitable conditions are imposed to obtain a strong convergence result for…