相关论文: Convergence of the Zipper algorithm for conformal …

In 2003 Peter Cameron introduced the concept of a Jordan scheme and asked whether there exist Jordan schemes which are not symmetrisations of coherent configurations (proper Jordan schemes). The question was answered affirmatively by the…

In the article we consider the composite conformal map which maps annulus to infinite region with symmetric hole and nearly circular hole. It is shown that such transformation is good if the distance between centers of holes are large or…

Simulation-based verification algorithms can provide formal safety guarantees for nonlinear and hybrid systems. The previous algorithms rely on user provided model annotations called discrepancy function, which are crucial for computing…

Recently, Armstrong, Guzm\'an, and Sing Long (2021), presented an optimal $O(n^2)$ time algorithm for strict circular seriation (called also the recognition of strict quasi-circular Robinson spaces). In this paper, we give a very simple…

We describe how to approximate the Riemann curvature tensor as well as sectional curvatures on possibly infinite-dimensional shape spaces that can be thought of as Riemannian manifolds. To this end, we extend the variational time…

Many interesting functions arising in applications map into Riemannian manifolds. We present an algorithm, using the manifold exponential and logarithm, for approximating such functions. Our approach extends approximation techniques for…

A sequential quadratic programming (SQP) algorithm is designed for nonsmooth optimization problems with upper-C^2 objective functions. Upper-C^2 functions are locally equivalent to difference-of-convex (DC) functions with smooth convex…

We prove that a "first-order" Sequential Quadratic Programming (SQP) algorithm for equality constrained optimization has local linear convergence with rate $(1-1/\kappa_R)^k$, where $\kappa_R$ is the condition number of the Riemannian…

We extend the result of Lavrentiev which asserts that the harmonic measure and the arc-length measure are $A_\infty$ equivalent in a chord-arc Jordan domain. By using this result we extend the classical result of Lindel\"of to the class of…

Uncertainty estimates must be calibrated (i.e., accurate) and sharp (i.e., informative) in order to be useful. This has motivated a variety of methods for recalibration, which use held-out data to turn an uncalibrated model into a…

This research is motivated by studying image processing algorithms through a topological lens. The images we focus on here are those that have been segmented by digital Jordan curves as a means of image compression. The algorithms of…

We consider an inertial primal-dual fixed point algorithm (IPDFP) to compute the minimizations of the following Problem (1.1). This is a full splitting approach, in the sense that the nonsmooth functions are processed individually via their…

This paper considers a consensus optimization problem, where all the nodes in a network, with access to the zeroth-order information of its local objective function only, attempt to cooperatively achieve a common minimizer of the sum of…

The Halpern algorithm is a powerful fixed point approximation method for finding the closest point in the fixed point set of a nonexpansive mapping to the initial point. However, in practice, it is not necessarily true that this algorithm…

Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…

The conformal method developed in the 1970s and the more recent Lagrangian and Hamiltonian conformal thin-sandwich methods are techniques for finding solutions of the Einstein constraint equations. We show that they are manifestations of a…

With the popularity of drone technologies, aerial photography has become prevalent in many daily scenarios such as environment monitoring, structure inspection, law enforcement etc. A central challenge in this domain is the efficient…

We give an algorithm for finding conformal mappings onto the upper half-plane and conformal modules of some types of polygons. The polygons are obtained by stretching along the real axis polyominoes i.e., polygons which are connected unions…

This paper studies the convergence properties of the inexact Jordan-Kinderlehrer-Otto (JKO) scheme and proximal-gradient algorithm in the context of Wasserstein spaces. The JKO scheme, a widely-used method for approximating solutions to…

Three themes of general topology: quotient spaces; absolute retracts; and inverse limits - are reapproached here in the setting of metrizable uniform spaces, with an eye to applications in geometric and algebraic topology. The results…