Related papers: On global solutions of the obstacle problem

We study the double obstacle problem for p-harmonic functions on arbitrary bounded nonopen sets E in quite general metric spaces. The Dirichlet and single obstacle problems are included as special cases. We obtain Adams' criterion for the…

We prove a Lagrangian analogue of the Conley conjecture: given a 1-periodic Tonelli Lagrangian with global flow on a closed configuration space, the associated Euler-Lagrange system has infinitely many periodic solutions. More precisely, we…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…

We consider an obstacle problem for elastic curves with fixed ends. We attempt to extend the graph approach provided in [8]. More precisely, we investigate nonexistence of graph solutions for special obstacles and extend the class of…

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…

Consider, in dimension 3, a system of coupled Klein-Gordon equations with different speeds, and an arbitrary quadratic nonlinearity. We show, for data which are small, smooth, and localized, that a global solution exists, and that it…

In the present note we prove a conjecture of Demailly for finite sets of sufficiently many very general points in projective spaces. This gives a lower bound on Waldschmidt constants of such sets. Waldschmidt constants are asymptotic…

We investigate the Cauchy-Dirichlet problem for linear parabolic equations in divergence form. Under mild assumptions on the source term and the domain, we prove the existence of globally H\"{o}lder continuous solutions. Notably, our…

The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…

Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…

For the thin obstacle problem in $\mathbb{R}^n$, $n\geq 2$, we prove that at all free boundary points, with the exception of a $(n-3)$-dimensional set, the solution differs from its blow-up by higher order corrections. This expansion…

We study certain obstacle type problems involving standard and nonlocal minimal surfaces. We obtain optimal regularity of the solution and a characterization of the free boundary.

This paper investigates the inverse problem of determining a general Signorini obstacle using boundary measurements. We demonstrate that both the shape of the obstacle and the obstacle function can be uniquely determined from solution…

We consider the bound-constrained global optimization of functions with low effective dimensionality, that are constant along an (unknown) linear subspace and only vary over the effective (complement) subspace. We aim to implicitly explore…

This paper analyzes the structure of the set of positive solutions of a class of one-dimensional superlinear indefinite bvp's. It is a paradigm of how mathematical analysis aids the numerical study of a problem, whereas simultaneously its…

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

We apply the topology of convergence on compact sets to define unpredictable functions [5, 6]. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and…

In this paper, we begin by constructing global linear maps on (n-2)-dimensional subspaces, derived from the local continuity of linear transformations among central sections of a convex body. Using these linear maps, we subsequently…