11 citations · 21 across the 9 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2024
Homotopy Methods for Convex Optimization
Andreas Klingler, Tim Netzer
Convex optimization encompasses a wide range of optimization problems that contain many efficiently solvable subclasses. Interior point methods are currently the state-of-the-art a…
math.OC2020★ 1 cited
Approximate tensor decompositions: disappearance of many separations
Gemma De las Cuevas, Andreas Klingler, Tim Netzer
It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representat…