Related papers: The planar Least Gradient problem in convex domain…
The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant…
We study the Stokes problem in a bounded planar domain $\Omega$ with a friction type boundary condition that switches between a slip and no-slip stage. Unlike our previous work [6], in the present paper the threshold value may depend on the…
We proceed with the investigation of the problem $(P_\lambda): $ $-\Delta u = \lambda b(x)|u|^{q-2}u +a(x)|u|^{p-2}u \ \mbox{ in } \Omega, \ \ \frac{\partial u}{\partial \mathbf{n}} = 0 \ \mbox{ on } \partial \Omega$, where $\Omega$ is a…
The present paper pioneers the study of the Dirichlet problem with $L^q$ boundary data for second order operators with complex coefficients in domains with lower dimensional boundaries, e.g., in $\Omega := \mathbb R^n \setminus \mathbb R^d$…
The least gradient problem (minimizing the total variation with given boundary data) is equivalent, in the plane, to the Beckmann minimal-flow problem with source and target measures located on the boundary of the domain, which is in turn…
We settle the issue of well-posedness for the Dirichlet problem for a higher order elliptic system ${\mathcal L}(x,D_x)$ with complex-valued, bounded, measurable coefficients in a Lipschitz domain $\Omega$, with boundary data in Besov…
We get a new multiplicity result for gradient systems. Here is a very particular corollary: Let $\Omega\subset {\bf R}^n$ ($n\geq 2$) be a smooth bounded domain and let $\Phi:{\bf R}^2\to {\bf R}$ be a $C^1$ function, with $\Phi(0,0)=0$,…
We establish some higher differentiability results of integer and fractional order for solution to non-autonomous obstacle problems of the form \begin{equation*} \min \left\{\int_{\Omega}f(x, Dv(x))\,:\, v\in…
We present a new feasible proximal gradient method for constrained optimization where both the objective and constraint functions are given by the summation of a smooth, possibly nonconvex function and a convex simple function. The…
The aim of this paper is twofold. First, we cut off a part of a convex surface by a plane near a ridge point and characterize the limiting behavior of the surface measure in $S^2$ induced by this part of surface when the plane approaches…
We consider the existence problem for `Steiner networks' (trivalent graphs with 120 degree angles at each junction) in strictly convex domains, with `Neumann' boundary conditions (orthogonal intersection with the domain boundary.) For each…
We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the…
Weakly harmonic maps from a domain $\Omega$ (the upper half-space $\Rd$ or a bounded $C^{1,\alpha}$ domain, $\alpha\in (0,1]$) into a smooth closed manifold are studied. Prescribing small Dirichlet data in either of the classes…
We study the sample complexity of the best-case Empirical Risk Minimizer in the setting of stochastic convex optimization. We show that there exists an instance in which the sample size is linear in the dimension, learning is possible, but…
Many fundamental problems in machine learning can be formulated by the convex program \[ \min_{\theta\in R^d}\ \sum_{i=1}^{n}f_{i}(\theta), \] where each $f_i$ is a convex, Lipschitz function supported on a subset of $d_i$ coordinates of…
Let $V$ be a finite set of vertices in the plane and $S$ be a finite set of polygonal obstacles, where the vertices of $S$ are in $V$. We show how to construct a plane $2$-spanner of the visibility graph of $V$ with respect to $S$. As this…
We design and analyze a novel accelerated gradient-based algorithm for a class of bilevel optimization problems. These problems have various applications arising from machine learning and image processing, where optimal solutions of the two…
The graph removal lemma is a fundamental result in extremal graph theory which says that for every fixed graph $H$ and $\varepsilon > 0$, if an $n$-vertex graph $G$ contains $\varepsilon n^2$ edge-disjoint copies of $H$ then $G$ contains…
We study the optimal lower and upper complexity bounds for finding approximate solutions to the composite problem $\min_x\ f(x)+h(Ax-b)$, where $f$ is smooth and $h$ is convex. Given access to the proximal operator of $h$, for strongly…
We study existence of minimizers of the general least gradient problem \[\inf_{u \in BV_f} \int_{\Omega}\varphi(x,Du),\] where $BV_f=\{u \in BV(\Omega): \ \ u|_{\partial \Omega}=f\}$, $f\in L^{1}(\partial \Omega)$, and $\varphi(x,\xi)$ is…