Related papers: Accelerating the Sinkhorn-Knopp iteration by Arnol…
Decentralized non-convex optimization is important in many problems of practical relevance. Existing decentralized methods, however, typically either lack convergence guarantees for general non-convex problems, or they suffer from a high…
We consider the entropic regularization of discretized optimal transport and propose to solve its optimality conditions via a logarithmic Newton iteration. We show a quadratic convergence rate and validate numerically that the method…
A novel linear-algebraic algorithm, multiple Arnoldi method, was developed in an interdisciplinary study between physics and applied mathematics and realized one-hundred-million-atom (100-nm-scale) electronic state calculations on the K…
An inverse problem of finding an unknown heat source for a class of linear parabolic equations is considered. Such problems can typically be converted to a direct problem with non-local conditions in time instead of an initial value…
We study the inverse eigenvalue problem for finding doubly stochastic matrices with specified eigenvalues. By making use of a combination of Dykstra's algorithm and an alternating projection process onto a non-convex set, we derive hybrid…
We derive and analyse a new variant of the iteratively regularized Landweber iteration, for solving linear and nonlinear ill-posed inverse problems. The method takes into account training data, which are used to estimate the interior of a…
In this work we are interested in general linear inverse problems where the corresponding forward problem is solved iteratively using fixed point methods. Then one-shot methods, which iterate at the same time on the forward problem solution…
This work is to provide a comprehensive treatment of the relationship between the theory of the generalized (palindromic) eigenvalue problem and the theory of the Sylvester-type equations. Under a regularity assumption for a specific matrix…
We pose the problem of approximating optimally a given nonnegative signal with the scalar autoconvolution of a nonnegative signal. The I-divergence is chosen as the optimality criterion being well suited to incorporate nonnegativity…
In this work, a nonlinear momentum method is introduced to enhance the convergence performance of momentum-based gradient optimization algorithms. Classical momentum methods, such as the Heavy Ball method, can be viewed as a dynamical…
Sinkhorn's alternative minimization algorithm applied to a positive $n\times n$ matrix converges to a doubly stochastic matrix. If the algorithm, applied to a $2\times 2$ matrix, converges in a finite number of iterations, then it converges…
We present an efficient method for computing dominant eigenvalues of large, nonsymmetric, diagonalizable matrices based on an adaptive block Lanczos algorithm combined with Chebyshev polynomial filtering. The proposed approach improves…
Invariant coordinate selection is an unsupervised multivariate data transformation useful in many contexts such as outlier detection or clustering. It is based on the simultaneous diagonalization of two affine equivariant and positive…
An efficient and robust restart strategy is important for any Krylov-based method for eigenvalue problems. The tensor infinite Arnoldi method (TIAR) is a Krylov-based method for solving nonlinear eigenvalue problems (NEPs). This method can…
We analyze the convergence of the (algebraic) multiplicative Schwarz method applied to linear algebraic systems with matrices having a special block structure that arises, for example, when a (partial) differential equation is posed and…
The Eberlein method is a Jacobi-type process for solving the eigenvalue problem of an arbitrary matrix. In each iteration two transformations are applied on the underlying matrix, a plane rotation and a non-unitary elementary…
The joint approximate diagonalization of non-commuting symmetric matrices is an important process in independent component analysis. This problem can be formulated as an optimization problem on the Stiefel manifold that can be solved using…
Nonlinear eigenvalue equations arise naturally in quantum information theory, particularly in the variational quantification of entanglement. In this work, we present a hybrid analytical and numerical framework for evaluating the geometric…
In this work we discuss the possibility to reduce the computational complexity of modal methods, i.e. methods based on eigenmodes expansion, from the third power to the second power of the number of eigenmodes. The proposed approach is…
Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value…