相关论文: Computing the quasiconvex envelope using a nonloca…
This paper is concerned with a PDE-based approach to the horizontally quasiconvex (h-quasiconvex for short) envelope of a given continuous function in the Heisenberg group. We provide a characterization for upper semicontinuous,…
In a series of papers Barron, Goebel, and Jensen studied Partial Differential Equations (PDE)s for quasiconvex (QC) functions \cite{barron2012functions, barron2012quasiconvex,barron2013quasiconvex,barron2013uniqueness}. To overcome the lack…
In this paper, we study the approximation of an unknown quasiconcave function based on limited partial information. Available information includes lower bounds on the values of the target function at a specified set of points, as well as…
In this note, we provide an explicit formula for computing the quasiconvex envelope of any real-valued function $W\colon\operatorname{SL}(2)\to\mathbb{R}$ with $W(RF)=W(FR)=W(F)$ for all $F\in\operatorname{SL}(2)$ and all…
We introduce a new class of quasilinear nonlocal operators and study equations involving these operators. The operators are degenerate elliptic and may have arbitrary growth in the gradient. Included are new nonlocal versions of p-Laplace,…
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either…
We present a new convolution layer for deep learning architectures which we call QuadConv -- an approximation to continuous convolution via quadrature. Our operator is developed explicitly for use on non-uniform, mesh-based data, and…
We propose a novel way of computing surface folding maps via solving a linear PDE. This framework is a generalization to the existing quasiconformal methods and allows manipulation of the geometry of folding. Moreover, the crucial quantity…
Solving a quadratic nonlinear system of equations (QNSE) is a fundamental, but important, task in nonlinear science. We propose an efficient quantum algorithm for solving $n$-dimensional QNSE. Our algorithm embeds QNSE into a…
We develop two-scale methods for computing the convex envelope of a continuous function over a convex domain in any dimension.This hinges on a fully nonlinear obstacle formulation [A. M. Oberman, "The convex envelope is the solution of a…
Nonlinear programming is explicitly analyzed via a novel perspective/method and from a bottom-up manner. The philosophy is based on the recent findings on convex quadratic equation (CQE), which help clarify a geometric interpretation that…
In numerical approaches to solving differential equations on a lattice, a representation of the derivative operator that correctly matches the continuum behaviour of functions of momentum up to the band limit must be non-local. We present…
Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…
Many problems in linear algebra -- such as those arising from non-Hermitian physics and differential equations -- can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. However, the existing Quantum…
In this paper, we introduce a new class of quasilinear operators, which represents a nonlocal version of the operator studied by Stuart and Zhou [1], inspired by models in nonlinear optics. We will study the existence of at least one or two…
Convexification based on convex envelopes is ubiquitous in the non-linear optimization literature. Thanks to considerable efforts of the optimization community for decades, we are able to compute the convex envelopes of a considerable…
We introduce and study a new class of generalized convex functions termed star quasiconvex functions. This class includes convex, star-convex, quasiconvex, quasar-convex, and positively homogeneous functions of any degree $p>0$ as special…
We introduce a definition of a quasiconvex function on an infinite directed regular tree that depends on what we understood by a segment on the tree. Our definition is based on thinking on segments as sub-trees with the root as the midpoint…
Partial differential equations (PDEs) are fundamental across numerous scientific fields. As these problems scale to high dimensions, classical numerical schemes introduce severe computational bottlenecks, known as the curse of…