Related papers: A convex-block approach for numerical radius inequ…
The main contributions of this paper are the proposition and the convergence analysis of a class of inertial projection-type algorithm for solving variational inequality problems in real Hilbert spaces where the underline operator is…
We propose a new asynchronous parallel block-descent algorithmic framework for the minimization of the sum of a smooth nonconvex function and a nonsmooth convex one, subject to both convex and nonconvex constraints. The proposed framework…
In this paper we establish some new Hermite-Hadamard type inequalities for two operator convex functions of selfadjoint operators in Hilbert spaces.
In this work, we improve and refine some numerical radius inequalities. In particular, for all Hilbert space operators $T$, the celebrated Kittaneh inequality reads: \begin{align*} \frac{1}{4}\left\| T^*T + TT^*\right\|\le w^{2 }\left(T…
Several new improvements of the $A$-numerical radius inequalities for operators acting on a semi-Hilbert space, i.e., a space generated by a positive operator $A$, are proved. In particular, among other inequalities, we show that…
Cyclic block coordinate methods are a fundamental class of optimization methods widely used in practice and implemented as part of standard software packages for statistical learning. Nevertheless, their convergence is generally not well…
Employing the Orlicz functions we extend the Buzano's inequality which is a refinement of the Cauchy-Schwarz inequality. Also using the Orlicz functions we obtain several numerical radius inequalities for a bounded linear operator as well…
Matrix versions of some basic convexity inequalities are given. Further results on the same topic are proved in the recent papers on arxiv: 1. Hermitian operators and convex functions, 2. A concavity inequality for symmetric norms, 3.…
We present some new upper and lower bounds for the numerical radius of bounded linear operators on a complex Hilbert space and show that these are stronger than the existing ones. In particular, we prove that if $A$ is a bounded linear…
In this paper we derive higher order convergence rates in terms of the Bregman distance for Tikhonov like convex regularisation for linear operator equations on Banach spaces. The approach is based on the idea of variational inequalities,…
(Block-)coordinate minimization is an iterative optimization method which in every iteration finds a global minimum of the objective over a variable or a subset of variables, while keeping the remaining variables constant. While for some…
Let $\mathbb{B}(\mathcal{H})$ be the algebra of all bounded linear operators on a Hilbert space $\mathcal{H}$ and let $N(\cdot)$ be a norm on $\mathbb{B}(\mathcal{H})$. For every $0\leq \nu \leq 1$, we introduce the $w_{_{(N,\nu)}}(A)$ as…
In this paper we develop a geometric approach to convex subdifferential calculus in finite dimensions with employing some ideas of modern variational analysis. This approach allows us to obtain natural and rather easy proofs of basic…
The randomized Kaczmarz method is an iterative algorithm that solves overdetermined systems of linear equations. Recently, the method was extended to systems of equalities and inequalities by Leventhal and Lewis. Even more recently, Needell…
This paper first proposes an N-block PCPM algorithm to solve N-block convex optimization problems with both linear and nonlinear constraints, with global convergence established. A linear convergence rate under the strong second-order…
We study the block-coordinate forward-backward algorithm in which the blocks are updated in a random and possibly parallel manner, according to arbitrary probabilities. The algorithm allows different stepsizes along the block-coordinates to…
The aim of this paper is to present an original approach that takes advantage from the geometric features of strictly convex functions to tackle the problem of finding the minimum from another perspective. The general idea is that near the…
The article deals with gradient-like iterative methods for solving nonlinear operator equations on Hilbert and Banach spaces. The authors formulate a general principle of studying such methods. This principle allows to formulate simple…
This paper studies the regularity problem for block uniformly elliptic operators in divergence form with complex bounded measurable coefficients. We consider the case where the boundary data belongs to Lebesgue spaces with weights in the…
We provide a number of sharp inequalities involving the usual operator norms of Hilbert space operators and powers of the numerical radii. Based on the traditional convexity inequalities for nonnegative real numbers and some generalize…