Related papers: Minimal Root's embeddings for general starting and…
We study the finite element approximation of the solid isotropic material with penalization method (SIMP) for the topology optimization problem of minimizing the compliance of a linearly elastic structure. To ensure the existence of a local…
The main goal of the paper is to show new stability and localization results for the finite element solution of the Stokes system in $W^{1,\infty}$ and $L^{\infty}$ norms under standard assumptions on the finite element spaces on…
In this work, we consider unfitted finite element methods for the numerical approximation of the Stokes problem. It is well-known that this kind of methods lead to arbitrarily ill-conditioned systems. In order to solve this issue, we…
In the absence of prior knowledge, ordinal embedding methods obtain new representation for items in a low-dimensional Euclidean space via a set of quadruple-wise comparisons. These ordinal comparisons often come from human annotators, and…
In this paper we consider (probability-)measure valued processes, which we call MVMs, which have a natural martingale structure. Following previous work of Eldan and Cox-K\"allblad, these processes are known to have a close connection to…
The planar Skorokhod embedding problem was first proposed and solved by R. Gross in 2019 [#gross2019]. Gross worked with probability distributions having finite second moment. In [#boudabra2019remarks, #Boudabra2020], the solutions extended…
The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely-behaved non convex…
We give sufficient conditions for a predicate P in a complete theory T to be stably embedded: P with its induced 0-definable structure has "finite rank", P has NIP in T and P is 1-stably embedded. This generalizes recent work by Hasson and…
We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many…
We consider cost minimizing stopping time solutions to Skorokhod embedding problems, which deal with transporting a source probability measure to a given target measure through a stopped Brownian process. PDEs and a free boundary problem…
This paper considers the problem of minimizing the ordered weighted average (or ordered median) function of finitely many rational functions over compact semi-algebraic sets. Ordered weighted averages of rational functions are not, in…
We present a new construction of a Skorohod embedding, namely, given a probability measure mu with zero expectation and finite variance, we construct an integrable stopping time T adapted to a filtration F_t, such that W_t has the law mu,…
The minimum linear ordering problem (MLOP) generalizes well-known combinatorial optimization problems such as minimum linear arrangement and minimum sum set cover. MLOP seeks to minimize an aggregated cost $f(\cdot)$ due to an ordering…
Recently, a new local optimality concept for minimax problems, termed calm local minimax points, has been introduced. In this paper, we extend this concept to a general class of nonsmooth, nonconvex nonconcave minimax problems with coupled…
We study a class of constrained nonconvex-nonconcave minimax optimization problems in which the inner maximization involves potentially complex constraints. Under the assumption that the inner problem of a novel lifted minimax reformulation…
Matrix completion is a basic machine learning problem that has wide applications, especially in collaborative filtering and recommender systems. Simple non-convex optimization algorithms are popular and effective in practice. Despite recent…
This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…
In this paper, we propose a unified approach for solving structure-preserving eigenvalue embedding problem (SEEP) for quadratic regular matrix polynomials with symmetry structures. First, we determine perturbations of a quadratic matrix…
The paper is devoted to determine necessary and sufficient conditions for existence of solutions to the problem ${\rm inf}{{\rm ess sup}_{x \in \Omega} f(\nabla u(x)): u \in u_0 + W^{1,\infty}_0(\Omega)}$ when the supremand $f$ is not…
We analyze continuous optimal transport problems in the so-called Kantorovich form, where we seek a transport plan between two marginals that are probability measures on compact subsets of Euclidean space. We consider the case of…