Computing the optimal partition of variables in multi-homogeneous homotopy methods
DOI10.1016/j.amc.2004.04.013zbMath1098.65053OpenAlexW2111752562MaRDI QIDQ1774889
Heng Liang, Shi, Leyuan, Feng-Shan Bai
Publication date: 4 May 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.04.013
global optimizationglobal convergencecomparison of methodsMarkov chainssystems of polynomial equationsnumerical experimentscombinatorial optimizationmulti-homogeneous Bézout numbermulti-homogeneous homotopy continuation methodrandom bipartition searchrandomized fission methodvariable partitions
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Computing all solutions to polynomial systems using homotopy continuation
- Bézout number calculations for multi-homogeneous polynomial systems
- Heuristic methods for computing the minimal multi-homogeneous Bézout number.
- Minimizing multi-homogeneous Bézout numbers by a local search method
- A Monte-Carlo Algorithm for Estimating the Permanent
- Finding all solutions to polynomial systems and other systems of equations
- Nested Partitions Method for Global Optimization
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
This page was built for publication: Computing the optimal partition of variables in multi-homogeneous homotopy methods