相关论文: On some properties of contracting matrices

In this paper we address a series of open questions about the construction of spatially coupled measurement matrices in compressed sensing. For hardware implementations one is forced to depart from the limiting regime of parameters in which…

We study orthogonal and symplectic matrix models with polynomial potentials and multi interval supports of the equilibrium measure. For these models we find the bounds (similar to the case of hermitian matrix models) for the rate of…

Three ways of constructing a non-Hermitian matrix with possible all real eigenvalues are discussed. They are PT symmetry, pseudo-Hermiticity, and generalized PT symmetry. Parameter counting is provided for each class. All three classes of…

With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…

We define a stochastic variant of the proximal point algorithm in the general setting of nonlinear (separable) Hadamard spaces for approximating zeros of the mean of a stochastically perturbed monotone vector field and prove its convergence…

Pseudo-marginal Markov chain Monte Carlo methods for sampling from intractable distributions have gained recent interest and have been theoretically studied in considerable depth. Their main appeal is that they are exact, in the sense that…

Let $V$ be a vector space over a field $\mathbb F$ with scalar product given by a nondegenerate sesquilinear form whose matrix is diagonal in some basis. If $\mathbb F=\mathbb C$, then we give canonical matrices of isometric and selfadjoint…

Most semantic drift studies report multiple signals e.g., embedding displacement, neighbor changes, distributional divergence, and recursive trajectory instability, without a shared explanatory theory that relates them. This paper proposes…

We generalize the notion of Lagrangian subspaces to self-orthogonal subspaces with respect to a (skew-)symmetric form, thus characterizing (skew-)self-adjoint and unitary operators by means of self-ortho-gonal subspaces. By orthogonality…

This work is a continuation and extension of the note published in the Russian Math Surveys 1997 n 6. For any pair of solutions of the spectral problem for the second order selfadjoint real Schrodinger Operator on the graph their Symplectic…

Stochastic non-smooth convex optimization constitutes a class of problems in machine learning and operations research. This paper considers minimization of a non-smooth function based on stochastic subgradients. When the function has a…

I introduce a novel mathematical framework integrating topological dynamics, operator algebras, and ergodic geometry to study lattices of asynchronous metric dynamical systems. Each node in the lattice carries an internal flow represented…

We present a general framework connecting global symmetries to the relativistic $S$-matrix through the lens of quantum information theory. Analyzing the 2-to-2 scattering of particles of any helicity, we systematically characterize…

The matrix logarithm, when applied to Hermitian positive definite matrices, is concave with respect to the positive semidefinite order. This operator concavity property leads to numerous concavity and convexity results for other matrix…

We consider the problem of sparse atomic optimization, where the notion of "sparsity" is generalized to meaning some linear combination of few atoms. The definition of atomic set is very broad; popular examples include the standard basis,…

We introduce and discuss two nonlinear perturbed extensions of the Cucker-Smale model with asymmetric coupling weights. The first model assumes a finite collection of autonomous agents aiming to perform a consensus process in the presence…

In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of…

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

This work considers the question: what convergence guarantees does the stochastic subgradient method have in the absence of smoothness and convexity? We prove that the stochastic subgradient method, on any semialgebraic locally Lipschitz…

The research in parallel machine scheduling in combinatorial optimization suggests that the desirable parallel efficiency could be achieved when the jobs are sorted in the non-increasing order of processing times. In this paper, we find…