a public good project by the
Synthesis
Company
of California

© 2026

On the complexity of convex hull algorithms if rotational minima can be found very fast | doi.page

0 citations0 references

Google Scholar doi.org

On the complexity of convex hull algorithms if rotational minima can be found very fast

Mathematical Methods of Operations Research·1988·Vol. 32(3-4), pp. 187–199

Ulrich Huckenbeck

Related Papers

→ Locating the local minima in lens design with machine learning(2021)3 cited
→ A Strategy to Solve the Local Minima Problem for Autonomous Mechanical Vehicles(2012)1 cited
→ Eliminating all bad Local Minima from Loss Landscapes without even adding an Extra Unit(2019)3 cited
A USEFUL BP ALGORITHM TO OVERCOME LOCAL MINIMA(1995)
Faster escaping from local minima for back-propagation algorithm(2008)