Related papers: Fenton type minimax problems for sum of translates…
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…
We consider the SUBSET SUM problem and its important variants in this paper. In the SUBSET SUM problem, a (multi-)set $X$ of $n$ positive numbers and a target number $t$ are given, and the task is to find a subset of $X$ with the maximal…
We consider a wide class of summatory functions F{f;N,p^m}=\sum_{k\leq N}f(p^m k), m\in \mathbb Z_+\cup {0}, associated with the multiplicative arithmetic functions f of a scaled variable k\in \mathbb Z_+, where p is a prime number.…
We show that any equicontractive, self-similar measure arising from the IFS of contractions $(S_{j})$, with self-similar set $[0,1]$, admits an isolated point in its set of local dimensions provided the images of $S_{j}(0,1)$ (suitably)…
We prove Local Central Limit Theorems (LLT) for partial sums of the form $S_n=\sum_{j=0}^{n-1}f_j(...,X_{j-1},X_j,X_{j+1},...)$, where $(X_j)$ is a Markov chains with equicontinuous conditional probabilities satisfying contraction…
For a fixed finite collection of graphs ${\cal F}$, the ${\cal F}$-M-DELETION problem asks, given an $n$-vertex input graph $G,$ for the minimum number of vertices that intersect all minor models in $G$ of the graphs in ${\cal F}$. by…
We consider the problem of minimizing the sum of submodular set functions assuming minimization oracles of each summand function. Most existing approaches reformulate the problem as the convex minimization of the sum of the corresponding…
We consider the setting of manifolds with ends which are obtained by compact perturbation (gluing) of ends of the form $\mathbb{R}^{n_i}\times \mathcal{M}_i$. We investigate family of vertical resolvent…
In \cite{Positive semidefinite solutions}, T. Furuta discusses the existence of positive semidefinite solutions of the operator equation $\sum_{j=1}^{n}A^{n-j}XA^{j-1}=B$. In this paper, we shall apply Grand Furuta inequality to study the…
Consider a sequence X_k=\sum_{j=0}^{\infty}c_j\xi_{k-j}, k\geq 1, where c_j, j\geq 0, is a sequence of constants and \xi_j, -\infty <j<\infty, is a sequence of independent identically distributed (i.i.d.) random variables (r.v.s) belonging…
We study the $\Gamma$-convergence of the functionals $F_n(u):= || f(\cdot,u(\cdot),Du(\cdot))||_{p_n(\cdot)}$ and $\mathcal{F}_n(u):= \int_{\Omega} \frac{1}{p_n(x)} f^{p_n(x)}(x,u(x),Du(x))dx$ defined on $X\in \{L^1(\Omega,\mathbb{R}^d),…
The problem of minimization of the least squares functional with a smooth, lower semi-continuous, convex regularizer $J(\cdot)$ is considered to be solved. Over some compact and convex subset $\Omega$ of the Hilbert space $\mathcal{H},$ the…
Encouraged by the study of extremal limits for sums of the form $$\lim_{N\to\infty}\frac{1 }{N}\sum_{n=1}^N c(x_n,y_n)$$ with uniformly distributed sequences $\{x_n\},\,\{y_n\}$ the following extremal problem is of interest…
We consider the problem of certifying an inequality of the form $f(x)\geq 0$, $\forall x\in K$, where $f$ is a multivariate transcendental function, and $K$ is a compact semialgebraic set. We introduce a certification method, combining…
Bundle methods have been intensively studied for solving both convex and nonconvex optimization problems. In most of the bundle methods developed thus far, at least one quadratic programming (QP) subproblem needs to be solved in each…
We propose a computationally tractable method for the identification of stable canonical discrete-time rational transfer function models, using frequency domain data. The problem is formulated as a global non-convex optimization problem…
The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-closed sets. We seek a feasible point $\mathbf{x}^*$ in the…
The functional generalized additive model (FGAM) provides a more flexible nonlinear functional regression model than the well-studied functional linear regression model. This paper restricts attention to the FGAM with identity link and…
We study Min-Max affine approximants of a continuous convex or concave function $f:\Delta\subset \mathbb R^k\xrightarrow{} \mathbb R$ where $\Delta$ is a convex compact subset of $\mathbb R^k$. In the case when $\Delta$ is a simplex we…
For a polynomial $f(x)\in \mathbb Z[x]$ we study an analogue of Jacobsthal function, defined by the formula \[ j_f(N)=\max_{m}\{\text{For some } x\in \mathbb N \text{ the inequality } (x+f(i),N)>1 \text{ holds for all }i\leq m\}. \] We…