Related papers: Optimal frame designs for multitasking devices wit…
In this paper, we give a geometric interpretation of optimal functionals in the context of intersection of symmetry planes and cyclic polytopes. For 1D CFTs, we demonstrate that at given derivative order, the functional is given by a…
We develop \emph{geometric optimisation} on the manifold of Hermitian positive definite (HPD) matrices. In particular, we consider optimising two types of cost functions: (i) geodesically convex (g-convex); and (ii) log-nonexpansive (LN).…
This paper is devoted to the analysis of multiphase shape optimization problems, which can formally be written as $\min\Big\{{g}(F_1(\Omega_1),\dots,F_h(\Omega_h))+ m\vert\,\bigcup_{i=1}^h\Omega_i\vert :\ \Omega_i\subset D,\ \Omega_i\cap…
In this paper, given a topological space $X$, an interval $I\subseteq {\bf R}$ and five continuous functions $\varphi, \psi, \omega :X\to {\bf R}$, $\alpha, \beta:I\to {\bf R}$, we are interested in the infimum of the function $\Phi:X\to…
Weight optimization of frame structures with continuous cross-section parametrization is a challenging non-convex problem that has traditionally been solved by local optimization techniques. Here, we exploit its inherent semi-algebraic…
This paper presents a novel numerical optimisation method for infinite dimensional optimisation. The functional optimisation makes minimal assumptions about the functional and without any specific knowledge on the derivative of the…
In the multi-unit pricing problem, multiple units of a single item are for sale. A buyer's valuation for $n$ units of the item is $v \min \{ n, d\} $, where the per unit valuation $v$ and the capacity $d$ are private information of the…
Due to the continuous advancements of orthogonal frequency division multiplexing (OFDM) and multiple antenna techniques, multiuser multiple input multiple output (MU-MIMO) OFDM is a key enabler of both fourth and fifth generation networks.…
We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed. Moreover, using a…
In this paper, we solve a maximization problem where the objective function is quadratic and convex or concave and the constraints set is the reachable value set of a convergent discrete-time affine system. Moreover, we assume that the…
The weight space of the Ising perceptron in which a set of random patterns is stored is examined using the generating function of the partition function $\phi(n)=(1/N)\log [Z^n]$ as the dimension of the weight vector $N$ tends to infinity,…
We consider the multiphase shape optimization problem $$\min\Big\{\sum_{i=1}^h\lambda_1(\Omega_i)+\alpha|\Omega_i|:\ \Omega_i\ \hbox{open},\ \Omega_i\subset D,\ \Omega_i\cap\Omega_j=\emptyset\Big\},$$ where $\alpha>0$ is a given constant…
We investigate multivariate integration for a space of infinitely times differentiable functions $\mathcal{F}_{s, \boldsymbol{u}} := \{f \in C^\infty [0,1]^s \mid \| f \|_{\mathcal{F}_{s, \boldsymbol{u}}} < \infty \}$, where $\| f…
Many practical problems need the output of a machine learning model to satisfy a set of constraints, $K$. Nevertheless, there is no known guarantee that classical neural network architectures can exactly encode constraints while…
We consider revenue-optimal mechanism design in the interdimensional setting, where one dimension is the 'value' of the buyer, and one is a 'type' that captures some auxiliary information. One setting is the FedEx Problem, for which FGKK…
We study optimal algorithms in adaptive sampling recovery of smooth functions defined on the unit $d$-cube ${\II}^d:= [0,1]^d$. The recovery error is measured in the quasi-norm $\|\cdot\|_q$ of $L_q := L_q(\II^d)$. For $B$ a subset in…
The design of minimum-compliance bending-resistant structures with continuous cross-section parameters is a challenging task because of its inherent non-convexity. Our contribution develops a strategy that facilitates computing all…
This paper proposes a new algorithm for solving constrained global optimization problems where both the objective function and constraints are one-dimensional non-differentiable multiextremal Lipschitz functions. Multiextremal constraints…
A new class of two-level non-regular fractional factorial designs is defined. We call this class an {\it affinely full-dimensional factorial design}, meaning that design points in the design of this class are not contained in any affine…
In this paper we develop optimal algorithms in the binary-forking model for a variety of fundamental problems, including sorting, semisorting, list ranking, tree contraction, range minima, and ordered set union, intersection and difference.…