The following pages link to (Q5219717):
Displaying 5 items.
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
- Geodesic Walks in Polytopes (Q5073522) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
- What Tropical Geometry Tells Us about the Complexity of Linear Programming (Q5150211) (← links)
- Projectively Self-Concordant Barriers (Q5868964) (← links)
