Polynomial programming using multi-homogeneous polynomial continuation
From MaRDI portal
Publication:1195745
DOI10.1016/0377-0427(92)90022-PzbMath0763.65047OpenAlexW1963561672MaRDI QIDQ1195745
Alexander P. Morgan, Layne T. Watson
Publication date: 18 January 1993
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(92)90022-p
global optimizationhomogenizationhomotopy algorithmglobally convergentpolynomial programmingparallel optimizationisolated solutionspolynomial continuation\(m\)- homogeneousmulti-homogeneouspolynomial program
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Non-convexity in noncooperative game theory
- Enlarging the region of convergence of Newton's method for constrained optimization
- Some numerical methods for limit analysis in continuum mechanics
- A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
- Algorithm 652