Optimization problem in multi-homogeneous homotopy method

DOI10.1080/10556780310001639744MaRDI QIDQ4657819zbMATH OpenOpenAlexFDO

Authors Heng Liang, Xiaoyan Liu, Fengshan Bai

Publication date 14 March 2005

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780310001639744

zbMATH Keywords

backward greedyhomotopy continuation methodmulti-homogeneous Bézout numbernumerical examplesoptimal variable partitionoptimizationpartition of variables

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Applications of mathematical programming (90C90)

Recommendations

• Homotopy method for multi-objective programming problems
• Homotopy method for a general multiobjective programming problem
• A homotopy method for multiobjective programming problems
• Homotopy method for a class of multiobjective optimization problems with equilibrium constraints
• Homotopy interior-point method for a general multiobjective programming problem
• Multistage Optimal Homotopy Asymptotic Method for Solving Initial-Value Problems
• Homogeneous algorithms for multiextremal optimization
• scientific article; zbMATH DE number 1778421
• A homotopy interior method for a general multi-objective programming problem
• The solution of multipoint boundary value problems by the optimal homotopy asymptotic method

Cites work

• Bézout number calculations for multi-homogeneous polynomial systems
• Computing all solutions to polynomial systems using homotopy continuation
• Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
• Finding all solutions to polynomial systems and other systems of equations
• Finding mixed cells in the mixed volume computation
• Heuristic methods for computing the minimal multi-homogeneous Bézout number.
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• Minimizing multi-homogeneous Bézout numbers by a local search method
• Mixed-volume computation by dynamic lifting applied to polynomial system solving
• The complexity of computing the permanent
• The number of roots of a system of equations

Cited in

(5)

• Polynomial programming using multi-homogeneous polynomial continuation
• Computing the optimal partition of variables in multi-homogeneous homotopy methods
• A hybrid algorithm for multi-homogeneous Bézout number
• Multistage Optimal Homotopy Asymptotic Method for Solving Initial-Value Problems
• A tabu search method for finding minimal multi-homogeneous Bézout number

This page was built for publication: Optimization problem in multi-homogeneous homotopy method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657819)