Related papers: A mini-max problem for self-adjoint Toeplitz matri…
In this paper, we study matrix representations of truncated Toeplitz operators with respect to orthonormal bases which are invariant under a canonical conjugation map. In particular, we determine necessary and sufficient conditions for when…
Covering ill-posed problems with compact and non-compact operators regarding the degree of ill-posedness is a never ending story written by many authors in the inverse problems literature. This paper tries to add a new narrative and some…
In this paper, it is shown that some new phenomenon related to the spectra of Toeplitz operators with bounded harmonic symbols on the Bergman space. On the one hand, we prove that the spectrum of the Toeplitz operator with symbol…
The minimum linear ordering problem (MLOP) generalizes well-known combinatorial optimization problems such as minimum linear arrangement and minimum sum set cover. MLOP seeks to minimize an aggregated cost $f(\cdot)$ due to an ordering…
In this work we study a special minimax problem where there are linear constraints that couple both the minimization and maximization decision variables. The problem is a generalization of the traditional saddle point problem (which does…
We solve the following problems associated with Toeplitz operators $T_{\Phi}$ on Hilbert space-valued Hardy spaces $H_{\mathcal{E}}^2(\mathbb{D}^n)$ over the unit polydisc $\mathbb{D}^n$. $(I)$ Given operator-valued bounded analytic…
The low-tubal-rank tensor model has been recently proposed for real-world multidimensional data. In this paper, we study the low-tubal-rank tensor completion problem, i.e., to recover a third-order tensor by observing a subset of its…
In this paper we study the Toeplitz algebra, which is generated by Toeplitz operators with bounded symbols on the Fock space $F^p_{\alpha}$. We show that the Toeplitz algebra coincides with each of the algebras generated by band-dominated,…
We provide improved convergence rates for constrained convex-concave min-max problems and monotone variational inequalities with higher-order smoothness. In min-max settings where the $p^{th}$-order derivatives are Lipschitz continuous, we…
We study the limiting eigenvalue distribution of $n\times n$ banded Toeplitz matrices as $n\to \infty$. From classical results of Schmidt-Spitzer and Hirschman it is known that the eigenvalues accumulate on a special curve in the complex…
We study the behaviour of functions of self-adjoint operators under relatively bounded and relatively trace class perturbation We introduce and study the class of relatively operator Lipschitz functions. An essential role is played by…
Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…
In this paper we describe some properties of companion matrices and demonstrate some special patterns that arise when a Toeplitz or a Hankel matrix is multiplied by a related companion matrix. We present a new condition, generalizing known…
We consider the problem of minimising the $L^\infty$ norm of a function of the hessian over a class of maps, subject to a mass constraint involving the $L^\infty$ norm of a function of the gradient and the map itself. We assume zeroth and…
In this paper we study the eigenvalues of Hermitian Toeplitz matrices with the entries $2,-1,0,\ldots,0,-\alpha$ in the first column. Notice that the generating symbol depends on the order $n$ of the matrix. If $|\alpha|\le 1$, then the…
In this paper, we provide explicit formulas for the exact inverses of the symmetric tridiagonal near-Toeplitz matrices characterized by weak diagonal dominance in the Toeplitz part. Furthermore, these findings extend to scenarios where the…
We introduce a new fundamental algorithm called Matrix-POAFD to solve the matrix least square problem. The method is based on the matching pursuit principle. The method directly extracts, among the given features as column vectors of the…
The approximate representation of operators by finite matrices is analysed in terms of accuracy and convergence. The identity operator, for example, can be reconstructed using a basis of harmonic oscillator states leading to a narrow peak…
In this paper, we study the minimax rates and provide an implementable convex algorithm for Poisson inverse problems under weak sparsity and physical constraints. In particular we assume the model $y_i \sim \mbox{Poisson}(Ta_i^{\top}f^*)$…
The Alternating Minimization Algorithm (AMA) has been proposed by Tseng to solve convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be…