Related papers: Matrix range characterizations of operator system …
To verify the correct operation of systems, engineers need to determine the set of configurations of a dynamical model that are able to safely reach a specified configuration under a control law. Unfortunately, constructing models for…
We present bounds on the maximal gain of adaptive and randomized algorithms over non-adaptive, deterministic ones for approximating linear operators on convex sets. If the sets are additionally symmetric, then our results are optimal. For…
An operator matrix $H$ associated with a lattice system describing three particles in interactions, without conservation of the number of particles, is considered. The structure of the essential spectrum of $H$ is described by the spectra…
Real linear operators between two complex Banach spaces unify naturally two important classes of linear operators and antilinear operators. We give a survey of basic geometric, spectral and duality properties of real linear operators. The…
In this paper, we consider the locally convex spaces of entire functions with growth given by proximate orders, and study the representation as a differential operator of a continuous homomorphism from such a space to another one. As a…
We prove the following characterization of the weak expectation property for operator systems in terms of Wittstock's matricial Riesz separation property: an operator system $S$ satisfies the weak expectation property if and only if…
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…
This paper has aim to characterize Fredholmness and Weylness of upper triangular operator matrices having arbitrary dimension n. We present various characterization results in the setting of infinite dimensional Hilbert spaces, thus…
In this article we study convex integer maximization problems with composite objective functions of the form $f(Wx)$, where $f$ is a convex function on $\R^d$ and $W$ is a $d\times n$ matrix with small or binary entries, over finite sets…
We give new necessary and sufficient conditions for the numerical range $W(T)$ of an operator $T \in \mathcal{B}(\mathcal{H})$ to be a subset of the closed elliptical set $K_\delta \subseteq \mathbb{C}$ given by \[ K_\delta {\stackrel{\rm…
The subdifferential of convex functions of the singular spectrum of real matrices has been widely studied in matrix analysis, optimization and automatic control theory. Convex optimization over spaces of tensors is now gaining much interest…
Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…
In the first part of the paper, we consider a discrete-time stochastic control system. We show that, under certain conditions, the set of random occupational measures generated by the state-control trajectories of the system as well as the…
We establish local characterizations of matrix monotonicity and convexity of fixed order by giving integral representations connecting the Loewner and Kraus matrices, previously known to characterize these properties, to respective Hankel…
In many cases the convexity of the image of a linear map with range is $R^n$ is automatic because of the facial structure of the domain of the map. We develop a four step procedure for proving this kind of ``automatic convexity''. To make…
By the help of power series f we can naturally construct another power series that has as coefficients the absolute values of the coefficients of f. Utilising these functions we prove some inequalities for the spectral radius of the bounded…
We investigate systems of the form $\{A^tg:g\in\mathcal{G},t\in[0,L]\}$ where $A \in B(\mathcal{H})$ is a normal operator in a separable Hilbert space $\mathcal{H}$, $\mathcal{G}\subset \mathcal{H}$ is a countable set, and $L$ is a positive…
We address optimization of nonlinear functions of the form $f(Wx)$, where $f:\R^d\to \R$ is a nonlinear function, $W$ is a $d\times n$ matrix, and feasible $x$ are in some large finite set $F$ of integer points in $\R^n$. One motivation is…
Iterative hard thresholding (IHT) has gained in popularity over the past decades in large-scale optimization. However, convergence properties of this method have only been explored recently in non-convex settings. In matrix completion,…
Efficient representations of convex sets are of crucial importance for many algorithms that work with them. It is well-known that sometimes, a complicated convex set can be expressed as the projection of a much simpler set in higher…