相关论文: Optimal frame designs for multitasking devices wit…

We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…

A real valued function $f$ defined on a real open interval $I$ is called $\Phi$-convex if, for all $x,y\in I$, $t\in[0,1]$ it satisfies $$ f(tx+(1-t)y)\leq tf(x)+(1-t)f(y)+t\Phi\big((1-t)|x-y|\big)+(1-t)\Phi\big(t|x-y|\big), $$ where…

The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is…

Let $\phi$ be a psh function on a bounded pseudoconvex open set $\Omega \subset \C^n$, and let ${\cal I}(\phi)$ be the associated multiplier ideal sheaf. Motivated by resolution of singularities issues, we establish an effective version of…

Convex geometries form a subclass of closure systems with unique criticals, or $UC$-systems. We show that the $F$-basis introduced in [1] for $UC$-systems, becomes optimum in convex geometries, in two essential parts of the basis: right…

One of the major issues in the computational mechanics is to take into account the geometrical complexity. To overcome this difficulty and to avoid the expensive mesh generation, geometrically unfitted methods, i.e. the numerical methods…

Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…

Binary quadratic programming problems have attracted much attention in the last few decades due to their potential applications. This type of problems are NP-hard in general, and still considered a challenge in the design of efficient…

The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…

Let $H$ be a complex Hilbert space and let $\Omega\subset H$ be a domain. In infinite dimensions, there is no canonical complex Monge--Amp\`ere operator and no basis-free determinant of the Levi form. Hence, a determinant-type…

A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…

Let $\mathbb{F}_{p^m}$ be a finite field with $p^m$ elements, where $p$ is an odd prime and $m$ is a positive integer. Recently, \cite{Hengar} and \cite{Wang2020} determined the weight distributions of subfield codes with the form…

Recent developments in storage -- especially in the area of resistive random access memory (ReRAM) -- are attempting to scale the storage density by regarding the information data as two-dimensional (2D), instead of one-dimensional (1D).…

We introduce a new perspective and mathematical model for the generalized frequency division multiplexing (GFDM) to analyze the effect of self-interferences and remove their detrimental impacts. Using this model, we express the GFDM signal…

When model predictions inform downstream decision making, a natural question is under what conditions can the decision-makers simply respond to the predictions as if they were the true outcomes. Calibration suffices to guarantee that simple…

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

In this paper, we present a topology optimization (TO) framework to enable automated design of mechanical components while ensuring the result can be manufactured using multi-axis machining. Although TO improves the part's performance, the…

In this paper, we study the problem of minimizing a sum of convex objective functions, which are locally available to agents in a network. Distributed optimization algorithms make it possible for the agents to cooperatively solve the…

Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a…

In this paper we analyze the relaxed form of a shape optimization problem with state equation $\{{array}{ll} -div \big(a(x)Du\big)=f\qquad\hbox{in}D \hbox{boundary conditions on}\partial D. {array}.$ The new fact is that the term $f$ is…