Related papers: Homotopy Iterators
Convex optimization encompasses a wide range of optimization problems that contain many efficiently solvable subclasses. Interior point methods are currently the state-of-the-art approach for solving such problems, particularly effective…
The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…
Given a sensor network, TDOA self-calibration aims at simultaneously estimating the positions of receivers and transmitters, and transmitters time offsets. This can be formulated as a system of polynomial equations. Due to the elevated…
Naturally occurring diagrams in algebraic topology are commutative up to homotopy, but not on the nose. It was quickly realized that very little can be done with this information. Homotopy coherent category theory arose out of a desire to…
Homotopy coherence has a considerable history, albeit also by other names. For this volume highlighting symmetries, the appropriate use is: Homotopy coherence of representations, at one time known as strong homotopy representations. We…
We propose a new algorithm for numerical path tracking in polynomial homotopy continuation. The algorithm is `robust' in the sense that it is designed to prevent path jumping and in many cases, it can be used in (only) double precision…
In latest years, several advancements have been made in symbolic-numerical eigenvalue techniques for solving polynomial systems. In this article, we add to this list. We design an algorithm which solves systems with isolated solutions…
We use homotopy operators for the $L_\infty$-algebra associated with an equivariant deformation problem in order to describe a smooth parametrization of the space of structures around a given one. Along the way we give new algebraic and…
In this work we present and study an iterative algorithm used to asymptotically solve nonlinear differential equations. This algorithm (Iterative First Order HAM or IFOHAM) is based on the first order equation of the Homotopy Analysis…
We propose a method for encoding iterators (and recursion operators in general) using interaction nets (INs). There are two main applications for this: the method can be used to obtain a visual nota- tion for functional programs; and it can…
The aim of this paper is to explain how the D-iteration can be used for an efficient asynchronous distributed computation. We present the main ideas of the method and illustrate them through very simple examples.
This article investigates the homotopy theory of simplicial commutative algebras with a view to homological applications.
We aim to solve a topology optimization problem where the distribution of material in the design domain is represented by a density function. To obtain candidates for local minima, we want to solve the first order optimality system via…
We present the proof assistant homotopy.io for working with finitely-presented semistrict higher categories. The tool runs in the browser with a point-and-click interface, allowing direct manipulation of proof objects via a graphical…
Homotopy methods are attractive due to their capability of solving difficult optimisation and optimal control problems. The underlying idea is to construct a homotopy, which may be considered as a continuous (zero) curve between the…
We introduce calculus-based formulas for the continuous Euler and homotopy operators. The 1D continuous homotopy operator automates integration by parts on the jet space. Its 3D generalization allows one to invert the total divergence…
Developing efficient and guaranteed nonconvex algorithms has been an important challenge in modern machine learning. Algorithms with good empirical performance such as stochastic gradient descent often lack theoretical guarantees. In this…
One of the most challenging and frequently arising problems in many areas of science is to find solutions of a system of multivariate nonlinear equations. There are several numerical methods that can find many (or all if the system is small…
We consider the problem of defining the integers in Homotopy Type Theory (HoTT). We can define the type of integers as signed natural numbers (i.e., using a coproduct), but its induction principle is very inconvenient to work with, since it…
We develop a homotopical variant of the classic notion of an algebraic theory as a tool for producing deformations of homotopy theories. From this, we extract a framework for constructing and reasoning with obstruction theories and spectral…