Related papers: Computing the quasiconvex envelope using a nonloca…
We provide quantitative inner and outer bounds for the symmetric quasiconvex hull $Q^e(\mathcal{U})$ on linear strains generated by three-well sets $\mathcal{U}$ in $\mathbb{R}^{2\times 2}_{sym}$. In our study, we consider all possible…
Numerically solving partial differential equations is a ubiquitous computational task with broad applications in many fields of science. Quantum computers can potentially provide high-degree polynomial speed-ups for solving PDEs, however…
Quadratic constrained quadratic programming problems often occur in various fields such as engineering practice, management science, and network communication. This article mainly studies a non convex quadratic programming problem with…
Let $E$ be a real vector space with dual space $E^*$ and let $C\subset E$ be a convex subset with more than one point. Let $f : C\to\mathbb{R}$ be a function satisfying a mild stability property at 'flat' points of the (relative) boundary…
A closed quasigeodesic is a closed curve on the surface of a polyhedron with at most $180^\circ$ of surface on both sides at all points; such curves can be locally unfolded straight. In 1949, Pogorelov proved that every convex polyhedron…
In this paper we introduce an enclosure of the numerical range of a class of rational operator functions. In contrast to the numerical range the presented enclosure can be computed exactly in the infinite dimensional case as well as in the…
The paper studies a method for solving elliptic partial differential equations posed on hypersurfaces in $\mathbb{R}^N$, $N=2,3$. The method allows a surface to be given implicitly as a zero level of a level set function. A surface equation…
Quantum error correction (QEC) is essential for quantum computing to mitigate the effect of errors on qubits, and surface code (SC) is one of the most promising QEC methods. Decoding SCs is the most computational expensive task in the…
In this paper we propose and analyze a new Multiscale Method for solving semi-linear elliptic problems with heterogeneous and highly variable coefficient functions. For this purpose we construct a generalized finite element basis that spans…
We consider Nash-Cournot oligopolistic equilibrium models involving separable concave cost functions. In contrast to the models with linear and convex cost functions, in these models a local equilibrium point may not be a global one. We…
We suggest a systematic method of extension of quasi-exactly solvable (QES) systems. We construct finite-dimensional subspaces on the basis of special functions (hypergeometric, Airy, Bessel ones) invariant with respect to the action of…
Non-convex optimization is ubiquitous in modern machine learning. Researchers devise non-convex objective functions and optimize them using off-the-shelf optimizers such as stochastic gradient descent and its variants, which leverage the…
We develop a new approach for the estimation of a multivariate function based on the economic axioms of quasiconvexity (and monotonicity). On the computational side, we prove the existence of the quasiconvex constrained least squares…
We present a Trefftz-type finite element method on meshes consisting of curvilinear polygons. Local basis functions are computed using integral equation techniques that allow for the efficient and accurate evaluation of quantities needed in…
We propose QPALM, a nonconvex quadratic programming (QP) solver based on the proximal augmented Lagrangian method. This method solves a sequence of inner subproblems which can be enforced to be strongly convex and which therefore admit a…
We consider estimating a compact set from finite data by approximating the support function of that set via sublinear regression. Support functions uniquely characterize a compact set up to closure of convexification, and are sublinear…
In this paper, we extend the class of strongly $E$-preinvex and strongly $E$-invex functions to quasi strongly $E$-preinvex, quasi strongly $E$-invex and pseudo strongly $E$-invex functions. Some nontrivial suitable examples have been…
We study the sample complexity of differentially private optimization of quasi-concave functions. For a fixed input domain $\mathcal{X}$, Cohen et al. (STOC 2023) proved that any generic private optimizer for low sensitive quasi-concave…
The Calder\'on problem consists in recovering an unknown coefficient of a partial differential equation from boundary measurements of its solution. These measurements give rise to a highly nonlinear forward operator. As a consequence, the…
Oberman gave a stochastic control formulation of the problem of estimating the convex envelope of a non-convex function. Based on this, we develop a reinforcement learning scheme to approximate the convex envelope, using a variant of…