Related papers: Hybrid Riemannian Conjugate Gradient Methods with …
We develop subgradient- and gradient-based methods for minimizing strongly convex functions under a notion which generalizes the standard Euclidean strong convexity. We propose a unifying framework for subgradient methods which yields two…
In 1963, Polyak proposed a simple condition that is sufficient to show a global linear convergence rate for gradient descent. This condition is a special case of the \L{}ojasiewicz inequality proposed in the same year, and it does not…
In this paper we combine concepts from Riemannian Optimization and the theory of Sobolev gradients to derive a new conjugate gradient method for direct minimization of the Gross-Pitaevskii energy functional with rotation. The conservation…
This paper proposes a generalized framework with joint normalization which learns lower-dimensional subspaces with maximum discriminative power by making use of the Riemannian geometry. In particular, we model the similarity/dissimilarity…
In this work, we analyze two of the most fundamental algorithms in geodesically convex optimization: Riemannian gradient descent and (possibly inexact) Riemannian proximal point. We quantify their rates of convergence and produce different…
The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and multiply connected domains on surfaces. In this paper the conjugate function method, earlier used for simply connected domains, is…
Dueling optimization considers optimizing an objective with access to only a comparison oracle of the objective function. It finds important applications in emerging fields such as recommendation systems and robotics. Existing works on…
Gradient schemes is a framework which enables the unified convergence analysis of many different methods -- such as finite elements (conforming, non-conforming and mixed) and finite volumes methods -- for $2^{\rm nd}$ order diffusion…
The ADM approach to canonical general relativity combined with Dirac's method of quantizing constrained systems leads to the Wheeler-DeWitt equation. A number of mathematical as well as physical difficulties that arise in connection with…
A variational formulation for accelerated optimization on normed vector spaces was recently introduced in Wibisono et al., and later generalized to the Riemannian manifold setting in Duruisseaux and Leok. This variational framework was…
We discuss first-order and second-order regularization effects for solutions to the classical heat equation. In particular we propose a global approach to study smoothing effects of Hamilton-Li-Yau type: such approach is nonlinear in spirit…
This article presents new local and global gradient estimates of Li-Yau type for positive solutions to a class of nonlinear elliptic equations on smooth metric measure spaces involving the Witten Laplacian. The estimates are derived under…
In this paper, we define the geometric median of a probability measure on a Riemannian manifold, give its characterization and a natural condition to ensure its uniqueness. In order to calculate the median in practical cases, we also…
Effective Hamiltonians arise in several problems, including homogenization of Hamilton--Jacobi equations, nonlinear control systems, Hamiltonian dynamics, and Aubry--Mather theory. In Aubry--Mather theory, related objects, Mather measures,…
In this paper, we propose a new global analysis framework for a class of low-rank matrix recovery problems on the Riemannian manifold. We analyze the global behavior for the Riemannian optimization with random initialization. We use the…
In this paper, we introduce the notion of generalized $\epsilon$-stationarity for a class of nonconvex and nonsmooth composite minimization problems on compact Riemannian submanifold embedded in Euclidean space. To find a generalized…
This paper introduces a new notion of a Fenchel conjugate, which generalizes the classical Fenchel conjugation to functions defined on Riemannian manifolds. We investigate its properties, e.g.,~the Fenchel--Young inequality and the…
Comparison of numerical performances of two methods for coefficient inverse problems is described. The first one is the classical Gel'fand-Levitan-Krein equation method, and the second one is the recently developed approximately globally…
The scarcity of labeled data is a long-standing challenge for many machine learning tasks. We propose our gradient flow method to leverage the existing dataset (i.e., source) to generate new samples that are close to the dataset of interest…
Optimization with constraints is a typical problem in quantum physics and quantum information science that becomes especially challenging for high-dimensional systems and complex architectures like tensor networks. Here we use ideas of…