Related papers: Brockett cost function for symplectic eigenvalues
In this note, we consider the highly nonconvex optimization problem associated with computing the rank decomposition of symmetric tensors. We formulate the invariance properties of the loss function and show that critical points detected by…
This paper deals with the eigenvalue problem for the operator $L=-\Delta -x\cdot \nabla $ with Dirichlet boundary conditions. We are interested in proving the existence of a set minimizing any eigenvalue $\lambda_k$ of $L$ under a suitable…
We propose two different strategies to find eigenvalues and eigenvectors of a given, not necessarily Hermitian, matrix $A$. Our methods apply also to the case of complex eigenvalues, making the strategies interesting for applications to…
We present a new approach to compute eigenvalues and eigenvectors of locally definite multiparameter eigenvalue problems by its signed multiindex. The method has the interpretation of a semismooth Newton method applied to certain functions…
We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…
We consider the class of convex minimization problems, composed of a self-concordant function, such as the $\log\det$ metric, a convex data fidelity term $h(\cdot)$ and, a regularizing -- possibly non-smooth -- function $g(\cdot)$. This…
A reduction of the transmission eigenvalue problem for multiplicative sign-definite perturbations of elliptic operators with constant coefficients to an eigenvalue problem for a non-selfadjoint compact operator is given. Sufficient…
We present a class of symplectic matrices which transform by similarity given $2n\times 2n$ -dimensional matrix into Bunse-Gerstner form. If the given matrix is skew-Hamiltonian, the transformation gives a solution of an antisymmetric…
By a special symplectic connection we mean a torsion free connection which is either the Levi-Civita connection of a Bochner-K\"ahler metric of arbitrary signature, a Bochner-bi-Lagrangian connection, a connection of Ricci type or a…
We develop a complete theory for the combinatorics of walk-counting on a directed graph in the case where each backtracking step is downweighted by a given factor. By deriving expressions for the associated generating functions, we also…
This paper studies theoretical lower bounds for estimating the trace of a matrix function, $\text{tr}(f(A))$, focusing on methods that use Hutchinson's method along with Block Krylov techniques. These methods work by approximating…
We study properties and algorithms of a minimization problem of the maximum generalized eigenvalue of symmetric-matrix-valued affine functions, which is nonsmooth and quasiconvex, and has application to eigenfrequency optimization of truss…
Symplectic quantization is a functional approach to quantum field theory that allows sampling of quantum fluctuations directly in Minkowski space time by means of a Hamiltonian dynamics in an intrinsic time $\tau$ which samples a…
Given a set of n data objects and their pairwise dissimilarities, the goal of the minimum quartet tree cost (MQTC) problem is to construct an optimal tree from the total number of possible combinations of quartet topologies on n, where…
Minimum cost homomorphism problems can be viewed as a generalization of list homomorphism problems. They also extend two well-known graph colouring problems: the minimum colour sum problem and the optimum cost chromatic partition problem.…
We compare the performances of symplectic and non-symplectic integrators for the computation of normal geodesics and conjugate points in sub-Riemannian geometry at the example of the Martinet case. For this case study we consider first the…
The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…
This note describes sufficient conditions under which total-cost and average-cost Markov decision processes (MDPs) with general state and action spaces, and with weakly continuous transition probabilities, can be reduced to discounted MDPs.…
This work is concerned with approximating the smallest eigenvalue of a parameter-dependent Hermitian matrix $A(\mu)$ for many parameter values $\mu \in \mathbb{R}^P$. The design of reliable and efficient algorithms for addressing this task…
In this paper, a class of nonlinear driftless control-affine systems satisfying the bracket generating condition is considered. A gradient-free optimization algorithm is developed for the minimization of a cost function along the…