Related papers: Log-convex sequences and nonzero proximate orders
Following Boros--Moll, a sequence $(a_n)$ is $m$-log-concave if $\mathcal{L}^j (a_n) \geq 0$ for all $j = 0, 1, \ldots, m$. Here, $\mathcal{L}$ is the operator defined by $\mathcal{L} (a_n) = a_n^2 - a_{n - 1} a_{n + 1}$. By a criterion of…
Let $z_1, \dots, z_m$ be $m$ distinct complex numbers, normalized to $|z_k| = 1$, and consider the polynomial $$ p_{m}(z) = \prod_{k=1}^{m}{(z-z_k)}.$$ We define a sequence of polynomials in a greedy fashion, $$ p_{N+1}(z) = p_{N}(z)…
The proximal point method for a special class of nonconvex multiobjective functions is studied in this paper. We show that the method is well defined and that the accumulation points of any generated sequence, if any, are Pareto--Clarke…
In this paper, we investigate the properties of sequences and series under the action of the log-concave operator \(\mathcal{L}\). We explore the relationship between the convergence of a sequence \((a_k)\) and the convergence of sequences…
We present several characterizations of uo-convergent nets or sequences in spaces of continuous functions $C(\Omega)$, $C_b(\Omega)$, $C_0(\Omega)$, and $C^\infty(\Omega)$, extending results of [vdW18]. In particular, it is shown that a…
We give a complete solution to the Borel-Ritt problem in non-uniform spaces $\mathscr{A}^-_{(M)}(S)$ of ultraholomorphic functions of Beurling type, where $S$ is an unbounded sector of the Riemann surface of the logarithm and $M$ is a…
Recollements of derived module categories are investigated, using a new technique, ladders of recollements, which are mutation sequences. The position in the ladder is shown to control whether a recollement restricts from unbounded to…
We present a study of the notion of coalgebraic simulation introduced by Hughes and Jacobs. Although in their original paper they allow any functorial order in their definition of coalgebraic simulation, for the simulation relations to have…
The article $-$ part of a larger thesis which aims to give a detailed description of the generalisation to the category of groups with operators of the classical theory of semisimplicity for modules $-$ presents a straightforward…
We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…
Let $\Omega\subset\mathbb{C}^n$ be a strictly pseudoconvex Runge domain with $C^2$-smooth defining function, $l\in\mathbb{N},$ $p\in(1,\infty).$ We prove that the holomorphic function $f$ has derivatives of order $l$ in $H^p(\Omega)$ if and…
We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this construction, we derive new lower bounds on the complexity of…
Recently, Liu, Moursi and Vanderwerff have introduced the class of super strongly nonexpansive mappings as a counterpart to operators which are maximally monotone and uniformly monotone. We give a quantitative study of these notions in the…
The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…
This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…
A plethora of spaces in Functional Analysis (Braun-Meise-Taylor and Carleman ultradifferentiable and ultraholomorphic classes; Orlicz, Besov, Lipschitz, Lebesque spaces, to cite the main ones) are defined by means of a weighted structure,…
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
We consider hierarchical variational inequality problems, or more generally, variational inequalities defined over the set of zeros of a monotone operator. This framework includes convex optimization over equilibrium constraints and…
By extending the classical quantitative approximation results for positive and linear operators in $L^{p}([0, 1]), 1\le p \le +\infty$ of Berens and DeVore in 1978 and of Swetits and Wood in 1983 to the more general case of sublinear,…