Related papers: Implementing real polyhedral homotopy
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
In this paper, we compute the homology group and cohomology algebra of various polyhedral product objects uniformly from the point of view of diagonal tensor product. As applications, we introduce the polyhedral product method into…
An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices.…
Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…
We present a new algorithm for solving the real roots of a bivariate polynomial system $\Sigma=\{f(x,y),g(x,y)\}$ with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for bivariate…
Speedup measures how much faster we can solve the same problem using many cores. If we can afford to keep the execution time fixed, then quality up measures how much better the solution will be computed using many cores. In this paper we…
By complexifying a Hamiltonian system one obtains dynamics on a holomorphic symplectic manifold. To invert this construction we present a theory of real forms which not only recovers the original system but also yields different real…
In this work we describe horofunction compactifications of metric spaces and finite dimensional real vector spaces through asymmetric metrics and asymmetric polyhedral norms by means of nonstandard methods, that is, ultrapowers of the…
This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…
In this article, we consider nonlinear complementarity problem. We introduce a new homotopy function for finding the solution of nonlinear complementarity problem through the trajectory . We show that the homotopy path approaching the…
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…
An abstract polytope is chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. There are still few examples of chiral polytopes, and few constructions that can create chiral…
We give a general method that may be effectively applied to the question of whether two components of a function space have the same homotopy type. We describe certain group-like actions on function spaces. Our basic results assert that if…
We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a…
We present a formalization of convex polyhedra in the proof assistant Coq. The cornerstone of our work is a complete implementation of the simplex method, together with the proof of its correctness and termination. This allows us to define…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
A method for solving zero-finding problems is developed by tracking homotopy paths, which define connecting channels between an auxiliary problem and the objective problem. Current algorithms' success highly relies on empirical knowledge,…
The paper presents a proof of the Hodge Riemann relations for the combinatorial intersection cohomology of a polytope, as fist given by K.Karu, in terms of geometric operations on polytopes.
Homotopy perturbation method is used for solving the multi-point boundary value problems. The approximate solution is found in the form of a rapidly convergent series. Several numerical examples have been considered to illustrate the…
A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…