相关论文: Duality for the gradient of a $p$-harmonic functio…
We study two notions of Dirichlet problem associated with BV energy minimizers (also called functions of least gradient) in bounded domains in metric measure spaces whose measure is doubling and supports a $(1,1)$-Poincar\'e inequality.…
We study the obstacle problem for unbounded sets in a proper metric measure space supporting a (p,p)-Poincare inequality. We prove that there exists a unique solution. We also prove that if the measure is doubling and the obstacle is…
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…
Given a convex optimization problem and its dual, there are many possible first-order algorithms. In this paper, we show the equivalence between mirror descent algorithms and algorithms generalizing the conditional gradient method. This is…
In this work we present two particular cases of the general duality result for linear optimisation problems over signed measures with infinitely many constraints in the form of integrals of functions with respect to the decision variables…
We study the Dirichlet problem for p-harmonic functions on metric spaces with respect to arbitrary compactifications. A particular focus is on the Perron method, and as a new approach to the invariance problem we introduce Sobolev-Perron…
We initiate the study of fine $p$-(super)minimizers, associated with $p$-harmonic functions, on finely open sets in metric spaces, where $1 < p < \infty$. After having developed their basic theory, we obtain the $p$-fine continuity of the…
We study the geometry of domains in complete metric measure spaces equipped with a doubling measure supporting a $1$-Poincar\'e inequality. We propose a notion of \emph{domain with boundary of positive mean curvature} and prove that, for…
In this paper we develop the Perron method for solving the Dirichlet problem for the analog of the p-Laplacian, i.e. for p-harmonic functions, with Mazurkiewicz boundary values. The setting considered here is that of metric spaces, where…
In this paper, we minimize the self-centered smoothed gap, a recently introduced optimality measure, in order to solve convex-concave saddle point problems. The self-centered smoothed gap can be computed as the sum of a convex, possibly…
The identification between the complex plane and the Riemann sphere preserves holomorphic and harmonic functions and is a classical tool. In this paper we consider a similar mapping from an unbounded metric space $X$ to a bounded space and…
Minimizing a convex function of a measure with a sparsity-inducing penalty is a typical problem arising, e.g., in sparse spikes deconvolution or two-layer neural networks training. We show that this problem can be solved by discretizing 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…
We consider structured optimisation problems defined in terms of the sum of a smooth and convex function, and a proper, l.s.c., convex (typically non-smooth) one in reflexive variable exponent Lebesgue spaces $L_{p(\cdot)}(\Omega)$. Due to…
We provide new insight into a {\em generalized conditional subgradient} algorithm and a {\em generalized mirror descent} algorithm for the convex minimization problem \[ \min_x \; \{f(Ax) + h(x)\}.\] As Bach showed in [{\em SIAM J. Optim.},…
The Perron method for solving the Dirichlet problem for $p$-harmonic functions is extended to unbounded open sets in the setting of a complete metric space with a doubling measure supporting a $p$-Poincar\'e inequality, $1<p<\infty$. The…
A problem of the erroneous duality gap caused by the presence of symmetries is solved in this paper utilizing point group theory. The optimization problems are first divided into two classes based on their predisposition to suffer from this…
We consider the problem of minimizing a convex objective which is the sum of a smooth part, with Lipschitz continuous gradient, and a nonsmooth part. Inspired by various applications, we focus on the case when the nonsmooth part is a…
We study the Dirichlet problem for least gradient functions for domains in metric spaces equipped with a doubling measure and supporting a (1,1)-Poincar\'e inequality when the boundary of the domain satisfies a positive mean curvature…
Many parametrization and mapping-related problems in geometry processing can be viewed as metric optimization problems, i.e., computing a metric minimizing a functional and satisfying a set of constraints, such as flatness. Penner…