Computing the optimal partition of variables in multi-homogeneous homotopy methods (Q1774889): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2004.04.013 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Finding all solutions to polynomial systems and other systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monte-Carlo Algorithm for Estimating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for computing the minimal multi-homogeneous Bézout number. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing multi-homogeneous Bézout numbers by a local search method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing all solutions to polynomial systems using homotopy continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Partitions Method for Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bézout number calculations for multi-homogeneous polynomial systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2004.04.013 / rank
 
Normal rank

Latest revision as of 10:30, 11 December 2024

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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references