Related papers: A convex-block approach for numerical radius inequ…
The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…
In this paper we study the convex problem of optimizing the sum of a smooth function and a compactly supported non-smooth term with a specific separable form. We analyze the block version of the generalized conditional gradient method when…
Several upper and lower bounds for the numerical radius of $2 \times 2$ operator matrices are developed which refine and generalize the earlier related bounds. In particular, we show that if $B,C$ are bounded linear operators on a complex…
We suggest simple implementable modifications of conditional gradient and gradient projection methods for smooth convex optimization problems in Hilbert spaces. Usually, the custom methods attain only weak convergence. We prove strong…
New inequalities for the $A$-numerical radius of the products and sums of operators acting on a semi-Hilbert space, i.e. a space generated by a positive semidefinite operator $A$, are established. In particular, it is proved for operators…
Some inequalities for quantum f-divergence of trace class operators in Hilbert spaces are obtained. It is shown that for normalised convex functions it is nonnegative. Some upper bounds for quantum f-divergence in terms of variational and…
Convex-nonconvex (CNC) regularization is a novel paradigm that employs a nonconvex penalty function while maintaining the convexity of the entire objective function. It has been successfully applied to problems in signal processing,…
In this paper we present a novel randomized block coordinate descent method for the minimization of a convex composite objective function. The method uses (approximate) partial second-order (curvature) information, so that the algorithm…
This paper investigates new properties of $q$-numerical ranges for compact normal operators and establishes refined upper bounds for the $q$-numerical radius of Hilbert space operators. We first prove that for a compact normal operator $T$…
The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex…
The alternating direction method of multipliers (ADMM) is a widely used method for solving many convex minimization models arising in signal and image processing. In this paper, we propose an inertial ADMM for solving a two-block separable…
We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compared to current state-of-the-art accelerated first-order…
In this paper, we state some characterizations of $h$-convex function is defined on a convex set in a linear space. By doing so, we extend the Jensen-Mercer inequality for $h$-convex function. We will also define $h$-convex function for…
This paper is devoted to a systematic study of certain geometric integral inequalities which arise in continuum combinatorial approaches to $L^p$-improving inequalities for Radon-like transforms over polynomial submanifolds of intermediate…
The Hildreth's algorithm is a row action method for solving large systems of inequalities. This algorithm is efficient for problems with sparse matrices, as opposed to direct methods such as Gaussian elimination or QR-factorization. We…
Let $A$ be a positive bounded linear operator on a complex Hilbert space $\mathcal{H}$ and $\mathcal{B}_{A}(\mathcal{H})$ be the subspace of all operators which admit $A$-adjoints operators. In this paper, we establish some inequalities…
Let $A$ be a positive bounded operator on a Hilbert space $\big(\mathcal{H}, \langle \cdot, \cdot\rangle \big)$. The semi-inner product ${\langle x, y\rangle}_A := \langle Ax, y\rangle$, $x, y\in\mathcal{H},$ induces a seminorm…
Several refinements of norm and numerical radius inequalities of bounded linear operators on a complex Hilbert space are given. In particular, we show that if $A$ is a bounded linear operator on a complex Hilbert space, then $$…
In this paper, we present several sharp upper bounds for the numerical radii of the diagonal and off-diagonal parts of the $2\times2$ block operator matrix $\begin{bmatrix}A&B\\ C&D\end{bmatrix}$. Among extensions of some results of…
This paper is focused on some properties of paramonotone operators on Banach spaces and their application to certain feasibility problems for convex sets in a Hilbert space and convex systems in the Euclidean space. In particular, it shows…