Search

In this paper, we use Aleksandrov's reflection principle to prove symmetry of solutions to F (∇ S n 2 u + u I) = f (u , u 2 + | ∇ S n u | 2 ) , where u is the support function of a convex body, and F is a function of principal radii. As a corollary, alongside [Ivaki, arXiv:2307.06252 ], we provide an alternative proof of the uniqueness of solution to the isotropic Gaussian-Minkowski problem. [ABSTRACT FROM AUTHOR]

In this paper, we establish an existence and uniqueness result for the system of quasilinear stochastic partial differential equations (SPDEs for short) with reflection in a convex domain in R K by analytical approach. The method is based on the approximation of the penalized systems of SPDEs. [ABSTRACT FROM AUTHOR]

Consider the semilinear elliptic equation − Δ u = λ f (u) in the unit ball B 1 ⊂ R N , with Dirichlet data u | ∂ B 1 = 0 , where λ ≥ 0 is a real parameter and f is a C 1 positive, nondecreasing and convex function in [ 0 , ∞) such that f (s) / s → ∞ as s → ∞. In this paper we study the behavior of f ′ (u ⁎) near the origin when u ⁎ , the extremal solution of the previous problem associated to λ = λ ⁎ , is singular. This answers to an open problems posed by Brezis and Vázquez [2, Open problem 5]. [ABSTRACT FROM AUTHOR]

In this paper we propose a primal-dual dynamical approach to the minimization of a structured convex function consisting of a smooth term, a nonsmooth term, and the composition of another nonsmooth term with a linear continuous operator. In this scope we introduce a dynamical system for which we prove that its trajectories asymptotically converge to a saddle point of the Lagrangian of the underlying convex minimization problem as time tends to infinity. In addition, we provide rates for both the violation of the feasibility condition by the ergodic trajectories and the convergence of the objective function along these ergodic trajectories to its minimal value. Explicit time discretization of the dynamical system results in a numerical algorithm which is a combination of the linearized proximal method of multipliers and the proximal ADMM algorithm. [ABSTRACT FROM AUTHOR]

Abstract In this paper we rigorously justify the propagation of chaos for the parabolic–elliptic Keller–Segel equation over bounded convex domains. The boundary condition under consideration is the no-flux condition. As intermediate steps, we establish the well-posedness of the associated stochastic equation as well as the well-posedness of the Keller–Segel equation for bounded weak solutions. [ABSTRACT FROM AUTHOR]

This paper studies traveling fronts to cooperation–diffusion systems in R N for N ≥ 3 . We consider ( N − 2 ) -dimensional smooth surfaces as boundaries of strictly convex compact sets in R N − 1 , and define an equivalence relation between them. We prove that there exists a traveling front associated with a given surface and show its stability. The associated traveling fronts coincide up to phase transition if and only if the given surfaces satisfy the equivalence relation. [ABSTRACT FROM AUTHOR]