Related papers: The dual of Philo's shortest line segment problem
The Longest Edge Bisection of a triangle is performed by joining the midpoint of its longest edge to the opposite vertex. Applying this procedure iteratively produces an infinite family of triangles. Surprisingly, a classical result of…
In this article, we investigate the existence, uniqueness, nonexistence, and regularity of weak solutions to the nonlinear fractional elliptic problem of type $(P)$ (see below) involving singular nonlinearity and singular weights in smooth…
Consider a line segment placed on a two-dimensional grid of rectangular tiles. This paper addresses the relationship between the length of the segment and the number of tiles it visits (i.e. has intersection with). The square grid is also…
In this paper, we study the behavior of multiple continua of solutions to the semilinear elliptic problem \begin{equation*} \begin{cases} -\Delta u = \lambda f(u) &\text{ in } \Omega, u=0 &\text{ on } \partial\Omega, \end{cases}…
The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…
We present two parallel optimization algorithms for a convex function $f$. The first algorithm optimizes over linear inequality constraints in a Hilbert space, $\mathbb H$, and the second over a non convex polyhedron in $\mathbb R^n$. The…
The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral. We characterize the existence of global optimal solutions of…
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
We prove existence of strong solutions to a family of some semilinear parabolic free boundary problems by means of elliptic regularization. Existence of solutions is obtained in two steps: we first show some uniform energy estimates and…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We propose a simple and natural approximation algorithm for the problem of finding a 2-edge-connected spanning subgraph of minimum total edge cost in a graph. The algorithm maintains a spanning forest starting with an empty edge set. In…
Recent quasi-optimal error estimates for the finite element approximation of total-variation regularized minimization problems require the existence of a Lipschitz continuous dual solution. We discuss the validity of this condition and…
In this article, we generalize the following problem, which is called the rational angle bisection problem, to the $n$-dimensional space $k^n$ over a subfield $k$ of $\mathbb R$: in the coordinate plane, for which rational numbers $a$ and…
We present a proximal gradient method for solving convex multiobjective optimization problems, where each objective function is the sum of two convex functions, with one assumed to be continuously differentiable. The algorithm incorporates…
Recently, the $L_p$ dual Minkowski problem for unbounded closed convex sets in a pointed closed convex cone was proposed and a weak solution to this problem was provided. In smooth setting, this problem is equivalent to solving the…
Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if…
We extend the well known bottleneck paths problem in two directions for directed unweighted (unit edge cost) graphs with positive real edge capacities. Firstly we narrow the problem domain and compute the bottleneck of the entire network in…
Best subset selection is considered the `gold standard' for many sparse learning problems. A variety of optimization techniques have been proposed to attack this non-smooth non-convex problem. In this paper, we investigate the dual forms of…
This paper proves the existence of optimal stopping times via elementary functional analytic arguments. The problem is first relaxed into a convex optimization problem over a closed convex subset of the unit ball of the dual of a Banach…
In this paper, we consider an equivalence problem of second order partially differential equations (PDE) and a duality of the flat differential equation. For the equivalence problem, explicit form of invariants (curvatures) are given. We…