Related papers: Towards computing high-order p-harmonic descent di…
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…
We consider a shape optimization problem written in the optimal control form: the governing operator is the $p$-Laplacian in the Euclidean space $\R^d$, the cost is of an integral type, and the control variable is the domain of the state…
We study the behavior of $p$-Dirichlet optimal design problem with volume constraint for $p$ large. As the limit as $p$ goes to infinity, we find a limiting free boundary problem governed by the infinity-Laplacian operator. We establish a…
An adaptive regularization algorithm using high-order models is proposed for partially separable convexly constrained nonlinear optimization problems whose objective function contains non-Lipschitzian $\ell_q$-norm regularization terms for…
This paper examines a variety of classical optimization problems, including well-known minimization tasks and more general variational inequalities. We consider a stochastic formulation of these problems, and unlike most previous work, we…
We study an inverse boundary value problem associated with $p$-Laplacian which is further perturbed by a linear second order term, defined on a bounded set $\Omega$ in $\R^n, n\geq 2$. We recover the coefficients at the boundary from the…
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…
In this article, a posteriori error analysis of the elliptic obstacle problem is addressed using hybrid high-order methods. The method involve cell unknowns represented by degree-$r$ polynomials and face unknowns represented by degree-$s$…
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…
We consider shape optimization problems with internal inclusion constraints, of the form $$\min\big\{J(\Omega)\ :\ \Dr\subset\Omega\subset\R^d,\ |\Omega|=m\big\},$$ where the set $\Dr$ is fixed, possibly unbounded, and $J$ depends on…
We present a new approach to discretizing shape optimization problems that generalizes standard moving mesh methods to higher-order mesh deformations and that is naturally compatible with higher-order finite element discretizations of…
We consider the finite element discretization of an optimal Dirichlet boundary control problem for the Laplacian, where the control is considered in $H^{1/2}(\Gamma)$. To avoid computing the latter norm numerically, we realize it using the…
In this paper, which corresponds to an updated version of the author's Habilitation lecture in Mathematics, we do an overview of several topics in elliptic problems. We review some old and new results regarding the Lane-Emden equation, both…
This article develops a solution for an inverse problem through the generalized method of lines. We consider a Laplace equation on a domain with internal and external boundaries with standard Dirichlet boundary conditions. Also, we specify…
We propose a new monotone finite difference discretization for the variational $p$-Laplace operator, \[ \Delta_p u=\text{div}(|\nabla u|^{p-2}\nabla u), \] and present a convergent numerical scheme for related Dirichlet problems. The…
We survey some recent regularity results for fractional p-Laplacian elliptic equations, especially focusing on pure and weighted boundary H\"older continuity of the solutions of related Dirichlet problems. Then, we present some applications…
Large scale optimization problems are ubiquitous in machine learning and data analysis and there is a plethora of algorithms for solving such problems. Many of these algorithms employ sub-sampling, as a way to either speed up the…
We propose a new asymptotic expansion for the fractional $p$-Laplacian with precise computations of the errors. Our approximation is shown to hold in the whole range $p\in(1,\infty)$ and $s\in(0,1)$, with errors that do not degenerate as…
In this paper, we study the Dirichlet problem for Laplace's equation in an open disk. The uniqueness of solutions is ensured by the well-known weak maximum principle. We introduce a novel approach to demonstrate the existence of a solution…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…