Related papers: The planar Least Gradient problem in convex domain…
We show that the linear span of the set of scalar products of gradients of harmonic functions on a bounded smooth domain $\Omega\subset \mathbb{R}^n$ which vanish on a closed proper subset of the boundary is dense in $L^1(\Omega)$. We apply…
We lower bound the complexity of finding $\epsilon$-stationary points (with gradient norm at most $\epsilon$) using stochastic first-order methods. In a well-studied model where algorithms access smooth, potentially non-convex functions…
A sufficient condition for the infinite dimensionality of the Bergman space of a pseudoconvex domain is given. This condition holds on any pseudoconvex domain that has at least one smooth boundary point of finite type in the sense of…
Consider a domain D in R^3 which is convex (possibly all R^3) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f : M --> D. Moreover, if D is smooth and bounded, then…
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…
We propose a gradient-based method for quadratic programming problems with a single linear constraint and bounds on the variables. Inspired by the GPCG algorithm for bound-constrained convex quadratic programming [J.J. Mor\'e and G.…
We study the Laplacian with zero magnetic field acting on complex functions of a planar domain $\Omega$, with magnetic Neumann boundary conditions. If $\Omega$ is simply connected then the spectrum reduces to the spectrum of the usual…
This paper presents a unified analysis for the proximal subgradient method (Prox-SubGrad) type approach to minimize an overall objective of $f(x)+r(x)$, subject to convex constraints, where both $f$ and $r$ are weakly convex, nonsmooth, and…
We study the Dirichlet problem for the Lagrangian phase operator, in both the real and complex setting. Our main result states that if $\Omega$ is a compact domain in $\mathbb{R}^{n}$ or $\mathbb{C}^n$, then there exists a solution to the…
Optimization problems occurring in a wide variety of physical design problems, including but not limited to optical engineering, quantum control, structural engineering, involve minimization of a simple cost function of the state of the…
The study of first-order optimization is sensitive to the assumptions made on the objective functions. These assumptions induce complexity classes which play a key role in worst-case analysis, including the fundamental concept of algorithm…
We investigate an initial-(periodic-)boundary value problem for a continuum equation, which is a model for motion of grain boundaries based on the underlying microscopic mechanisms of line defects (disconnections) and integrated the effects…
We consider the Dirichlet problem for a class of semilinear equations on two dimensional convex domains. We give a sufficient condition for the solution to be concave. Our condition uses comparison with ellipses, and is motivated by an idea…
Given a plane geometric graph $G$ on $n$ vertices, we want to augment it so that given parity constraints of the vertex degrees are met. In other words, given a subset $R$ of the vertices, we are interested in a plane geometric supergraph…
We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…
We prove lower bounds on the complexity of finding $\epsilon$-stationary points (points $x$ such that $\|\nabla f(x)\| \le \epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity…
We describe a new technique for computing lower-bounds on the minimum energy configuration of a planar Markov Random Field (MRF). Our method successively adds large numbers of constraints and enforces consistency over binary projections of…
We study the generalized boundary value problem for nonnegative solutions of of $-\Delta u+g(u)=0$ in a bounded Lipschitz domain $\Omega$, when $g$ is continuous and nondecreasing. Using the harmonic measure of $\Omega$, we define a trace…
We consider straight line drawings of a planar graph $G$ with possible edge crossings. The \emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as possible to new positions. Let $fix(G)$ denote the maximum…
We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…