Related papers: Pointwise gradient estimate of the ritz projection

Motivated by the geometric reduction of Cauchy--Szeg\H{o} projections on quadratic surfaces of higher codimension (Nagel--Ricci--Stein, 2001) and recent developments on the real-variable theory adapted to twisted multiparameter structures…

Pointwise estimates for the gradient of solutions to the $p$-Laplace system with right-hand side in divergence form are established. They enable us to develop a nonlinear counterpart of the classical Calder\'on-Zygmund theory in terms of…

We prove global convergence in function space for the steepest descent method in shape optimisation with semilinear elliptic partial differential equations. Steepest descent is realized in the Lipschitz topology. In addition, we prove a…

For complete affine manifolds we introduce a definition of compactification based on the projective differential geometry (i.e.\ geodesic path data) of the given connection. The definition of projective compactness involves a real parameter…

Variable order structures model situations in which the comparison between two points depends on a point-to-cone map. In this paper, an inexact projected gradient method for solving smooth constrained vector optimization problems on…

Proximal gradient methods are a popular tool for the solution of structured, nonsmooth minimization problems. In this work, we investigate an extension of the former to general Banach spaces and provide worst-case convergence rates for,…

Let $D\subset\mathbb C^n$ be a bounded, strongly pseudoconvex domain whose boundary $bD$ satisfies the minimal regularity condition of class $C^2$. A 2017 result of Lanzani \& Stein states that the Cauchy--Szeg\"{o} projection $S_\omega$…

We investigate fundamental properties of the proximal point algorithm for Lipschitz convex functions on (proper, geodesic) Gromov hyperbolic spaces. We show that the proximal point algorithm from an arbitrary initial point can find a point…

We propose a robust method for location estimation in various matrix manifolds based on the projected Frobenius median, which is closely related to the spatial median. This method applies broadly to matrix manifolds, including Stiefel and…

This work deals with approximate solution of generalized eigenvalue problem with coefficient matrix that is an affine function of d-parameters. The coefficient matrix is assumed to be symmetric positive definite and spectrally equivalent to…

The discretization of least-squares problems for linear ill-posed operator equations in Hilbert spaces is considered. The main subject of this article concerns conditions for convergence of the associated discretized minimum-norm…

Estimation of the level set of a function (i.e., regions where the function exceeds some value) is an important problem with applications in digital elevation mapping, medical imaging, astronomy, etc. In many applications, the function of…

We consider the composite minimization problem with the objective function being the sum of a continuously differentiable and a merely lower semicontinuous and extended-valued function. The proximal gradient method is probably the most…

In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…

We derive estimates relating the values of a solution at any two points to the distance between the points, for quasilinear isotropic elliptic equations on compact Riemannian manifolds, depending only on dimension and a lower bound for the…

We propose a stochastic optimization method for the minimization of the sum of three convex functions, one of which has Lipschitz continuous gradient as well as restricted strong convexity. Our approach is most suitable in the setting where…

This paper proposes a Riemannian Multiobjective Proximal Gradient Method (RMPGM) for composite optimization problems on manifolds. Unlike scalarization-based approaches, the proposed framework directly handles vector-valued objectives and…

We consider a linear-quadratic optimization problem with pointwise bounds on the state for which the constraint is given by the Laplace-Beltrami equation (to have uniqueness we add an lower order term) on a two-dimensional surface . By…

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…

In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…