English
Related papers

Related papers: On approximately Convex and Affine Sequences

200 papers

Summability methods for ultraholomorphic classes in sectors, defined in terms of a strongly regular sequence $\mathbb{M}=(M_p)_{p\in\mathbb{N}_0}$, have been put forward by A. Lastra, S. Malek and the second author [1], and their validity…

Classical Analysis and ODEs · Mathematics 2018-02-16 Javier Jiménez-Garrido , Javier Sanz , Gerhard Schindl

In this manuscript, we propose a general proximal quasi-Newton method tailored for nonconvex and nonsmooth optimization problems, where we do not require the sequence of the variable metric (or Hessian approximation) to be uniformly bounded…

Optimization and Control · Mathematics 2025-07-28 Xiaoxi Jia

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

Symbolic Computation · Computer Science 2013-06-19 Marc Mezzarobba , Bruno Salvy

We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…

Probability · Mathematics 2011-10-28 Miguel Abadi , Rodrigo Lambert

Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…

Optimization and Control · Mathematics 2025-01-30 Reinier Diàz Millàn , Nadezda Sukhorukova , Julien Ugon

In this paper we analyze several new methods for solving nonconvex optimization problems with the objective function formed as a sum of two terms: one is nonconvex and smooth, and another is convex but simple and its structure is known.…

Optimization and Control · Mathematics 2014-06-25 A. Patrascu , I. Necoara

A set of reals $A=\{a_1,...,a_n\}$ labeled in increasing order is called convex if there exists a continuous strictly convex function $f$ such that $f(i)=a_i$ for every $i$. Given a convex set $A$, we prove…

Combinatorics · Mathematics 2011-08-23 Liangpan Li

Absolute continuity implies uniform continuity, but generally not vice versa. In this short note, we present one sufficient condition for a uniformly continuous function to be absolutely continuous, which is the following theorem: For a…

Classical Analysis and ODEs · Mathematics 2015-03-17 Kai Yang , Chenhong Zhu

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Number Theory · Mathematics 2025-06-04 Ritesh Dwivedi , Rohit Yadav

A (d-parameter) basic nilsequence is a sequence of the form \psi(n)=f(a^{n}x), n \in Z^{d}, where x is a point of a compact nilmanifold X, a is a translation on X, and f is a continuous function on X; a nilsequence is a uniform limit of…

Dynamical Systems · Mathematics 2019-11-06 Alexander Leibman

We study homogenization it its most basic form $$-\left(a\left(\frac{x}{\varepsilon}\right) u_{\varepsilon}'(x)\right)' = f(x) \quad \mbox{for} ~x \in (0,1),$$ where $a(\cdot)$ is a positive $1-$periodic continuous function, $f$ is smooth…

Analysis of PDEs · Mathematics 2019-03-26 Stefan Steinerberger

We study non-stationary averaging processes, where each term of a sequence is a weighted average of previous terms, namely $a_{n+1} = \sum_{j=1}^n p_n(j) a_j$. Our results extend classical theory in two distinct regimes. First, we prove a…

Probability · Mathematics 2026-03-18 Saba Lepsveridze , Elchanan Mossel

For a weight-set $A\subseteq \mathbb Z_n$, the $A$-weighted zero-sum constant $C_A(n)$ is defined to be the smallest natural number $k$, such that any sequence of $k$ elements in $\mathbb Z_n$ has an $A$-weighted zero-sum subsequence of…

Number Theory · Mathematics 2022-12-13 Santanu Mondal , Krishnendu Paul , Shameek Paul

A sequence of points $z_k$ in the unit disk is said to be thin for a given decrease function $\rho$, if there is a nontrivial bounded holomorphic function such that the infinite series $\sum_k \rho(1-|z_k|)|f(z_k)|$ converges. All sequences…

Complex Variables · Mathematics 2007-05-23 Vladimir Ya. Eiderman , Pascal J. Thomas

For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of…

Metric Geometry · Mathematics 2019-05-20 Satoko Moriguchi , Kazuo Murota , Akihisa Tamura , Fabio Tardella

This paper presents a convex sufficient condition for solving a system of nonlinear equations under parametric changes and proposes a sequential convex optimization method for solving robust optimization problems with nonlinear equality…

Optimization and Control · Mathematics 2019-09-05 Dongchan Lee , Konstantin Turitsyn , Jean-Jacques Slotine

A review of the state of the art of the comparison between any two different modes of convergence of sequences of measurable functions is carried out with focus on the algebraic structure of the families under analysis. As a complement of…

Functional Analysis · Mathematics 2026-04-10 L. Bernal-González , M. C. Calderón-Moreno , P. J. Gerlach-Mena , J. A. Prado-Bassas

In this paper we apply ideas from the theory of Uniform Distribution of sequences to Functional Analysis and then drawing inspiration from the consequent results, we study concepts and results in Uniform Distribution itself. So let $E$ be a…

Functional Analysis · Mathematics 2023-05-23 S. K. Mercourakis , G. Vassiliadis

The present paper is devoted to a theory of profile decomposition for bounded sequences in \emph{homogeneous} Sobolev spaces, and it enables us to analyze the lack of compactness of bounded sequences. For every bounded sequence in…

Functional Analysis · Mathematics 2022-02-15 Mizuho Okumura

Let $[n]=\{1, \ldots, n\}$. A sequence $u=a_1a_2\dots a_l$ over $[n]$ is called $k$-sparse if $a_i = a_j$, $i > j$ implies $i-j\geq k$. In other words, every consecutive subsequence of $u$ of length at most $k$ does not have letters in…

Combinatorics · Mathematics 2013-11-08 Kok Bin Wong , Cheng Yeaw Ku