Related papers: Towards computing high-order p-harmonic descent di…
Every convex optimization problem has a dual problem. The $p$-Dirichlet problem in metric measure spaces is an optimization problem whose solutions are $p$-harmonic functions. What is its dual problem? In this paper, we give an answer to…
We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorial optimization as a special case. In this…
In this paper, we study matrix scaling and balancing, which are fundamental problems in scientific computing, with a long line of work on them that dates back to the 1960s. We provide algorithms for both these problems that, ignoring…
In this paper we discuss the obstacle problem for the $p$-Laplace operator. We prove optimal growth results for the solution. Of particular interest is the point-wise regularity of the solution at free boundary points. The most surprising…
This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…
In this paper we study numerical approximations of the evolution problem for the nonlocal $p$-Laplacian with homogeneous Neumann boundary conditions. First, we derive a bound on the distance between two continuous-in-time trajectories…
We establish an explicit maximum principle for the Dirichlet problem associated with the $p$-Laplacian ($p>1$), where the constant depends on both $p$ and the geometry of the domain. From this result we derive two main applications. First,…
We propose a novel Hybrid High-Order method for the Cahn-Hilliard problem with convection. The proposed method is valid in two and three space dimensions, and it supports arbitrary approximation orders on general meshes containing…
We suggest a novel shape matching algorithm for three-dimensional surface meshes of disk or sphere topology. The method is based on the physical theory of nonlinear elasticity and can hence handle large rotations and deformations.…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
An analytical solution to the Hill problem Hamiltonian expanded about the libration points has been obtained by means of perturbation techniques. In order to compute the higher orders of the perturbation solution that are needed to capture…
A short account of recent existence and multiplicity theorems on the Dirichlet problem for an elliptic equation with $(p,q)$-Laplacian in a bounded domain is performed. Both eigenvalue problems and different types of perturbation terms are…
In this paper, we revisit the old problem of compact finite difference approximations of the homogeneous Dirichlet problem in dimension 1. We design a large and natural set of schemes of arbitrary high order, and we equip this set with an…
In large-scale applications, such as machine learning, it is desirable to design non-convex optimization algorithms with a high degree of parallelization. In this work, we study the adaptive complexity of finding a stationary point, which…
In this article, the problems to be studied are the following \leqnomode \begin{equation*} \label{p} \left\{\begin{array}{ll} (-\Delta )_p^s u \pm \dfrac{|u|^{p-2}u}{|x|^{sp}} = \lambda f(x,u) & \quad \mbox{in }\ \Omega\\[0.3cm] u= 0 &…
We derive a residual-based $hp$-a posteriori error estimator for hybrid high-order (HHO) methods on simplicial meshes applied to the biharmonic problem posed on two- and three-dimensional polytopal Lipschitz domains. The a posteriori error…
The purpose of this study is twofold. First, we revisit a shape optimization reformulation of a prototypical shape inverse problem and briefly propose a simple yet efficient numerical approach for solving the corresponding minimization…
In this paper we make a study of a partial integral differential equation with $p$-Laplacian using a mixed finite element method. Two stable and convergent fixed point schemes are proposed to solve the nonlinear algebraic system. Using the…
A new decomposition optimization algorithm, called \textit{path-following gradient-based decomposition}, is proposed to solve separable convex optimization problems. Unlike path-following Newton methods considered in the literature, this…
In this paper, we derive a new $p$-Logarithmic Sobolev inequality and optimal continuous and compact embeddings into Orlicz-type spaces of the function space associated with the logarithmic $p$-Laplacian. As an application of these results,…