Results 11 to 20 of about 530,367 (189)
Robust Adaptive Beamforming for General-Rank Signal Model with Positive Semi-Definite Constraint via POTDC [PDF]
, 2012 The robust adaptive beamforming (RAB) problem for general-rank signal model with an additional positive semi-definite constraint is considered. Using the principle of the worst-case performance optimization, such RAB problem leads to a difference-of ...
Khabbazibasmenj, Arash +1 more
core +1 more source
Functions Like Convex Functions [PDF]
Journal of Function Spaces, 2015 The paper deals with convex sets, functions satisfying the global convexity property, and positive linear functionals. Jensen's type inequalities can be obtained by using convex combinations with the common center. Following the idea of the common center, the functional forms of Jensen's inequality are considered in this paper.
openaire +3 more sources
Convex relaxations of componentwise convex functions
Computers & Chemical Engineering, 2019 Published by Elsevier Science, Amsterdam [u.a.]
Najman, Jaromil +2 more
openaire +4 more sources
Modulus of convexity for operator convex functions [PDF]
Journal of Mathematical Physics, 2014 Given an operator convex function f(x), we obtain an operator-valued lower bound for cf(x) + (1 − c)f(y) − f(cx + (1 − c)y), c ∈ [0, 1]. The lower bound is expressed in terms of the matrix Bregman divergence. A similar inequality is shown to be false for functions that are convex but not operator convex.
openaire +5 more sources
Quotients of continuous convex functions on nonreflexive Banach spaces [PDF]
, 2007 On each nonreflexive Banach space X there exists a positive continuous convex function f such that 1/f is not a d.c. function (i.e., a difference of two continuous convex functions). This result together with known ones implies that X is reflexive if and
Holicky, P. +3 more
core +1 more source
On uniformly convex functions [PDF]
Journal of Mathematical Analysis and Applications, 2022 Non-convex functions that yet satisfy a condition of uniform convexity for non-close points can arise in discrete constructions. We prove that this sort of discrete uniform convexity is inherited by the convex envelope, which is the key to obtain other remarkable properties such as the coercivity.
M. Raja, Guillaume Grelier
openaire +3 more sources
Extremal Approximately Convex Functions and Estimating the Size of Convex Hulls [PDF]
, 1998 A real valued function $f$ defined on a convex $K$ is anemconvex function iff it satisfies $$ f((x+y)/2) \le (f(x)+f(y))/2 + 1. $$ A thorough study of approximately convex functions is made.
Dilworth, S. J. +2 more
core +3 more sources
Projections Onto Convex Sets (POCS) Based Optimization by Lifting [PDF]
, 2013 Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented.
Bozkurt, A. +7 more
core +2 more sources
On entropic quantities related to the classical capacity of infinite dimensional quantum channels
, 2004 In this paper we consider the $\chi$-function (the Holevo capacity of constrained channel) and the convex closure of the output entropy for arbitrary infinite dimensional channel.
Shirokov, M. E.
core +2 more sources
The number of directed k-convex polyominoes [PDF]
, 2015 We present a new method to obtain the generating functions for directed convex polyominoes according to several different statistics including: width, height, size of last column/row and number of corners.
Boussicault, Adrien +2 more
core +4 more sources