1 citations · 2 across the 8 of their papers we have counts for
8 papers
Convex optimization on moment polytopes: Hadamard mirror descent and efficient algorithms for quantum functionals and other tensor parameters
Mahmut Levent Doğan, Keiya Sakabe, Michael Walter
Convex optimization on polytopes arises in many areas of science. When the polytope is given implicitly or has exponentially many vertices and facets, standard methods may not appl…
Resultant multiplicity via projective degrees and applications to tensor eigenvalues
Mahmut Levent Doğan, Elias Tsigaridas, Zafeirakis Zafeirakopoulos
Given a system of homogeneous forms in variables of the same degree, Macaulay's resultant vanishes precisely when the polynomials have a commo…
Small Resultant Systems via Linear Combinations
M. Levent Doğan, Elias Tsigaridas, Zafeirakis Zafeirakopoulos
For a system of homogeneous polynomials of degree in variables, say , we consider the problem of constructing resultant systems. A resultant system is a f…
Strassen's support functionals coincide with the quantum functionals
Keiya Sakabe, Mahmut Levent Doğan, Michael Walter
Strassen's asymptotic spectrum offers a framework for analyzing the complexity of tensors. It has found applications in diverse areas, from computer science to additive combinatori…
Optimal Preconditioning is a Geodesically Convex Optimization Problem
M. Levent Doğan, Alperen Ergür, Elias Tsigaridas
We introduce a unified framework for computing approximately-optimal preconditioners for solving linear and non-linear systems of equations. We demonstrate that the condition numbe…
Complexity of Robust Orbit Problems for Torus Actions and the abc-conjecture
Peter Bürgisser, Mahmut Levent Doğan, Visu Makam +2
When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous que…
Deterministic Approximation Algorithms for Volumes of Spectrahedra
Mahmut Levent Doğan, Jonathan Leake, Mohan Ravichandran
We give a method for computing asymptotic formulas and approximations for the volumes of spectrahedra, based on the maximum-entropy principle from statistical physics. The method g…
On the complexity of Chow and Hurwitz forms
Mahmut Levent Doğan, Alperen Ali Ergür, Elias Tsigaridas
We consider the bit complexity of computing Chow forms and their generalization to multiprojective spaces. We develop a deterministic algorithm using resultants and obtain a single…