Computing the optimal partition of variables in multi-homogeneous homotopy methods (Q1774889)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing the optimal partition of variables in multi-homogeneous homotopy methods |
scientific article |
Statements
Computing the optimal partition of variables in multi-homogeneous homotopy methods (English)
0 references
4 May 2005
0 references
The authors consider the multi-homogeneous homotopy continuation method for finding all isolated solutions of systems of polynomial equations. The number of solution curves to be followed in this homotopy method, the so-called multi-homogeneous Bézout number, depends on the partition of the variables. A smaller number of solution curves to be followed reduces the computational cost of the method. Therefore, the problem of finding the partition of the variables which minimizes the multi-homogeneous Bézout number is studied. A new method, the randomized fission method, for solving this combinatorial optimization problem is presented. A crucial part of this method is the so-called random bipartition search (RBS). For RBS global convergence with probability one is shown and the expected number of search steps is estimated. Numerical experiments are presented which show the efficiency of the new method in comparison with other methods from the literature.
0 references
multi-homogeneous Bézout number
0 references
variable partitions
0 references
Markov chains
0 references
global optimization
0 references
comparison of methods
0 references
multi-homogeneous homotopy continuation method
0 references
systems of polynomial equations
0 references
randomized fission method
0 references
combinatorial optimization
0 references
random bipartition search
0 references
global convergence
0 references
numerical experiments
0 references
0 references