English
Related papers

Related papers: Modulus of convexity for operator convex functions

200 papers

We study the boundary behaviour of a variant of the Fridman's invariant function (defined in terms of the Bergman metric) on Levi corank one domains, strongly pseudoconvex domains, smoothly bounded convex domains in $ \mathbb{C}^n $ and…

Complex Variables · Mathematics 2024-01-09 Rahul Kumar , Prachi Mahajan

Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we…

Classical Analysis and ODEs · Mathematics 2014-08-19 Heinz H. Bauschke , Yves Lucet , Hung M. Phan

We apply upper and lower compensated convex transforms, which are `tight' one-sided approximations of a given function, to the extraction of fine geometric singularities from semiconvex/semiconcave functions and DC-functions in…

Optimization and Control · Mathematics 2016-10-06 Kewei Zhang , Elaine Crooks , Antonio Orlando

The Coifman-Fefferman inequality implies quite easily that a Calderon-Zygmund operator $T$ acts boundedly in a Banach lattice $X$ on $\mathbb R^n$ if the Hardy-Littlewood maximal operator $M$ is bounded in both $X$ and $X'$. We discuss this…

Functional Analysis · Mathematics 2013-10-09 Dmitry V. Rutsky

We give an extension of Hua's inequality in pre-Hilbert $C^*$-modules without using convexity or the classical Hua's inequality. As a consequence, some known and new generalizations of this inequality are deduced. Providing a Jensen…

Operator Algebras · Mathematics 2010-05-31 Mohammad Sal Moslehian

For $1<p<\infty$ and $M$ the centered Hardy-Littlewood maximal operator on $\mathbb{R}$, we consider whether there is some $\varepsilon=\varepsilon(p)>0$ such that $\|Mf\|_p\ge (1+\varepsilon)||f||_p$. We prove this for $1<p<2$. For $2\le…

Classical Analysis and ODEs · Mathematics 2019-07-22 Paata Ivanisvili , Samuel Zbarsky

We study the optimal lower and upper complexity bounds for finding approximate solutions to the composite problem $\min_x\ f(x)+h(Ax-b)$, where $f$ is smooth and $h$ is convex. Given access to the proximal operator of $h$, for strongly…

Optimization and Control · Mathematics 2023-08-15 Zhenyuan Zhu , Fan Chen , Junyu Zhang , Zaiwen Wen

Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…

Discrete Mathematics · Computer Science 2020-07-01 Rishabh Iyer , Jeff Bilmes

This work is concerned with the convex analysis of functions defined on (not necessarily finite-dimensional) Hilbert spaces whose values depend solely on a certain ``spectrum'' of the arguments, a class we term ``spectral functions.'' We…

Optimization and Control · Mathematics 2026-03-11 Hòa T. Bùi , Minh N. Bùi , Christian Clason

Considering the weighted concept of majorization, Sherman obtained generalization of majorization inequality for convex functions known as Sherman's inequality. We extend Sherman's result to the class of n-strongly convex functions using…

Classical Analysis and ODEs · Mathematics 2019-05-21 Slavica Ivelić Bradanović

Given any ${\bf{a}}: = \left( {a_1 ,a_2 , \ldots ,a_n } \right)$ and ${\bf{b}}: = \left( {b_1 ,b_2 , \ldots ,b_n } \right)$ in $\mathbb{R}^n$. The $\textbf{n}$-fold convex function defined on $\left[ {{\bf{a}},{\bf{b}}} \right]$,…

Classical Analysis and ODEs · Mathematics 2016-04-08 Mohammad W. Alomari

Motivated by some recently established operator Jensen-type inequalities related to a usual convexity, in the present paper we derive several more accurate operator Jensen-type inequalities for certain subclasses of convex functions. More…

Functional Analysis · Mathematics 2018-05-11 Mojtaba Bakherad , Mohsen Kian , Mario Krnic , Seyyed Alireza Ahmadi

The problem of finding the minimizer of a sum of convex functions is central to the field of optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the sum. In this…

Optimization and Control · Mathematics 2020-03-23 Kananart Kuwaranancharoen , Shreyas Sundaram

The main result of the present theoretical paper is an original decomposition formula for the proximal operator of the sum of two proper, lower semicontinuous and convex functions $f$ and $g$. For this purpose, we introduce a new operator,…

Optimization and Control · Mathematics 2018-06-13 Samir Adly , Loïc Bourdin , Fabien Caubet

Motivated by the Maximum Theorem for convex functions (in the setting of linear spaces) and for subadditive functions (in the setting of Abelian semigroups), we establish a Maximum Theorem for the class of generalized convex functions,…

Classical Analysis and ODEs · Mathematics 2021-12-21 Zsolt Páles

In this paper functions $f:D\to\mathbb{R}$ satisfying the inequality \[ f\Big(\frac{x+y}{2}\Big)\leq\frac12f(x)+\frac12f(y) +\varphi\Big(\frac{x-y}{2}\Big) \qquad(x,y\in D) \] are studied, where $D$ is a nonempty convex subset of a real…

Classical Analysis and ODEs · Mathematics 2024-12-10 Gábor Marcell Molnár , Zsolt Páles

In what follows we improve an inequality related to matrix theory. T. Laffey proved (2013) a weaker form of this inequality [2].

General Mathematics · Mathematics 2016-05-20 Dov Aharonov

There are presented certain results on extending continuous linear operators defined on spaces of E-valued continuous functions (defined on a compact Hausdorff space X) to linear operators defined on spaces of E-valued measurable functions…

Functional Analysis · Mathematics 2017-05-26 Piotr Niemiec

The problem of finding the minimizer of a sum of convex functions is central to the field of distributed optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the…

Optimization and Control · Mathematics 2018-12-05 Kananart Kuwaranancharoen , Shreyas Sundaram

We characterize proximity operators, that is to say functions that map a vector to a solution of a penalized least squares optimization problem. Proximity operators of convex penalties have been widely studied and fully characterized by…

Classical Analysis and ODEs · Mathematics 2020-02-24 Rémi Gribonval , Mila Nikolova