Is there any non-linear optimization technique whose running time depends on the diameter of the underlying polytope(induced by constraints)

24 Views Asked by At

It is well known that the running time of the simplex algorithm depends on the diameter of the polytope induced by the constraints. Is there any non-linear optimization technique that also has this property ?