Related papers: Convergence of an iterative algorithm for Teichm\"…

A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…

In this article a unified approach to iterative soft-thresholding algorithms for the solution of linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate the algorithm in the framework of generalized…

We propose the graph description of Teichm\"uller theory of surfaces with marked points on boundary components (bordered surfaces). Introducing new parameters, we formulate this theory in terms of hyperbolic geometry. We can then describe…

We consider the matrix completion problem where the aim is to esti-mate a large data matrix for which only a relatively small random subset of its entries is observed. Quite popular approaches to matrix completion problem are iterative…

Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical relations. The incremental nature of algorithms for computing…

In the iterative algorithm recently proposed by Waxman for solving eigenvalue problems, we point out that the convergence rate may be improved. For many non-singular symmetric potentials which vanish asymptotically, a simple analytical…

Let $f$ be a harmonic map from a Riemann surface to a Riemannian $n$-manifold. We prove that if there is a holomorphic diffeomorphism $h$ between open subsets of the surface such that $f\circ h = f$, then $f$ factors through a holomorphic…

Considering the Teichm\"uller space of a surface equipped with Thurston's Lipschitz metric, we study geodesic segments whose endpoints have bounded combinatorics. We show that these geodesics are cobounded, and that the closest-point…

We compare some natural triangulations of the Teichm\"uller space of hyperbolic surfaces with geodesic boundary and of some bordifications. We adapt Scannell-Wolf's proof to show that grafting semi-infinite cylinders at the ends of…

We present a new family of min-max optimization algorithms that automatically exploit the geometry of the gradient data observed at earlier iterations to perform more informative extra-gradient steps in later ones. Thanks to this adaptation…

We investigate the continuity of boundary operators, such as the Neumann-to-Dirichlet map, with respect to the coefficient matrices of the underlying elliptic equations. We show that for nonsmooth coefficients the correct notion of…

A new 3D localization and mapping techinque with terrain inclination assistance is proposed in this paper to allow a robot to identify its location and build a global map in an outdoor environment. The Iterative Closest Points (ICP)…

We present an iterative scheme designed to recover calibrated I, Q, and U maps from Planck-HFI data using the orbital dipole due to the satellite motion with respect to the Solar System frame. It combines a map reconstruction, based on a…

We show that complex geometric features of Teichmuller spaces create explicitly the extremals of generic homogeneous holomorphic functionals on univalent functions. In particular this gives proofs of the well-known Zalcman and Bieberbach…

This paper formulates the problem of Extremum Seeking for optimization of cost functions defined on Riemannian manifolds. We extend the conventional extremum seeking algorithms for optimization problems in Euclidean spaces to optimization…

This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…

A novel algorithm for the recovery of low-rank matrices acquired via compressive linear measurements is proposed and analyzed. The algorithm, a variation on the iterative hard thresholding algorithm for low-rank recovery, is designed to…

In this paper, we prove the strong convergence theorems for nearly nonexpansive mappings, using the modified Picard-Mann hybrid iteration process in the context of uniformly convex Banach space.

We establish the regularity theory for certain critical elliptic systems with an anti-symmetric structure under inhomogeneous Neumann and Dirichlet boundary constraints. As applications, we prove full regularity and smooth estimates at the…

The focus of this work is on an alternative implementation of the iterative ensemble smoother (iES). We show that iteration formulae similar to those used in \cite{chen2013-levenberg,emerick2012ensemble} can be derived by adopting a…