Abstract
AbstractThe sequential simplex optimization algorithm has been translated into non‐Euclidean space. A study of the algorithm in this space suggests that the path of convergence of the simplex depends on the properties of the space so that different convergence paths can be obtained even with the same starting points. The path of convergence approaches the path observed in Euclidean space as the metric constant of the hyperbolic space increases.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
