Related papers: A van der Corput-type algorithm for LS-sequences o…
In this paper, we study a class of fractional semi-infinite polynomial programming problems involving s.o.s-convex polynomial functions. For such a problem, by a conic reformulation proposed in our previous work and the quadratic modules…
Points of interest on a map such as restaurants, hotels, or subway stations, give rise to categorical point data: data that have a fixed location and one or more categorical attributes. Consequently, recent years have seen various set…
We determine fundamental systems of invariants for complex solvable rigid Lie algebras having nonsplit nilradicals of characteristic sequence $(3,1,..,1)$, these algebras being the natural followers of solvable algebras having Heisenberg…
In recent years, saliency ranking has emerged as a challenging task focusing on assessing the degree of saliency at instance-level. Being subjective, even humans struggle to identify the precise order of all salient instances. Previous…
The $LS$-sequences are a parametric family of sequences of points in the unit interval. They were introduced by Carbone, who also proved that under an appropriate choice of the parameters $L$ and $S$, such sequences are low-discrepancy. The…
We study the complexity of sampling from a distribution over all index subsets of the set $\{1,...,n\}$ with the probability of a subset $S$ proportional to the determinant of the submatrix $\mathbf{L}_S$ of some $n\times n$ p.s.d. matrix…
We study the Carleson's problem on Damek-Ricci spaces $S$ for dispersive equations: \begin{equation*} \begin{cases} i\frac{\partial u}{\partial t} +\Psi(\sqrt{-\mathcal{L}} )u=0\:,\: (x,t) \in S \times \mathbb{R} \:, \\ u(0,\cdot)=f\:,\:…
We develop a general deterministic distributed method for locally rounding fractional solutions of graph problems for which the analysis can be broken down into analyzing pairs of vertices. Roughly speaking, the method can transform…
The inverse of the star-discrepancy problem asks for point sets $P_{N,s}$ of size $N$ in the $s$-dimensional unit cube $[0,1]^s$ whose star-discrepancy $D^\ast(P_{N,s})$ satisfies $$D^\ast(P_{N,s}) \le C \sqrt{s/N},$$ where $C> 0$ is a…
We develop a distributed stochastic gradient descent algorithm for solving non-convex optimization problems under the assumption that the local objective functions are twice continuously differentiable with Lipschitz continuous gradients…
In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly…
We study the problem of assortative and disassortative partitions on random $d$-regular graphs. Nodes in the graph are partitioned into two non-empty groups. In the assortative partition every node requires at least $H$ of their neighbors…
We give a summary of the results from Parts I-V (math.RT/9804086, math.RT/9804087, math.RT/9804088, math.RT/9810013, math.RT/9810014). Our work originated from harmonic analysis on the infinite symmetric group. The problem of spectral…
We construct new sequence transformations based on Wynn's epsilon and rho algorithms. The recursions of the new algorithms include the recursions of Wynn's epsilon and rho algorithm and of Osada's generalized rho algorithm as special cases.…
We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections of subgroups, and isomorphisms of combinatorial structures.…
Recently, a novel method based on coding partitions [1]-[4] has been used to derive power series expansions to previously intractable problems. In this method the coefficients at $k$ are determined by summing the contributions made by each…
We propose a proximal point algorithm to solve LAROS problem, that is the problem of finding a "large approximately rank-one submatrix". This LAROS problem is used to sequentially extract features in data. We also develop a new stopping…
For a finite point set in $\mathbb{R}^d$, we consider a peeling process where the vertices of the convex hull are removed at each step. The layer number $L(X)$ of a given point set $X$ is defined as the number of steps of the peeling…
This work introduces a kernel-independent, multilevel, adaptive algorithm for efficiently evaluating a discrete convolution kernel with a given source distribution. The method is based on linear algebraic tools such as low rank…
This paper presents fast first-order methods for solving linear programs (LPs) approximately. We adapt online linear programming algorithms to offline LPs and obtain algorithms that avoid any matrix multiplication. We also introduce a…