Timo de Wolff

Orcid: 0000-0003-0883-1389

Affiliations:
  • Technische Universität Braunschweig, Germany


According to our database1, Timo de Wolff authored at least 24 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion.
CoRR, 2024

Initial Application of SONC to Lyapunov Stability of Dynamical Systems.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

2023
Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks.
SIAM J. Appl. Dyn. Syst., September, 2023

Realistic Runtime Analysis for Quantum Simplex Computation.
CoRR, 2023

2022
The Algebraic Boundary of the Sonc-Cone.
SIAM J. Appl. Algebra Geom., 2022

Initial steps in the classification of maximal mediated sets.
J. Symb. Comput., 2022

Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials.
Found. Comput. Math., 2022

Learning Variational Models with Unrolling and Bilevel Optimization.
CoRR, 2022

2020
Computing the real isolated points of an algebraic hypersurface.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Global optimization via the dual SONC cone and linear programming.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019
Lopsided approximation of amoebas.
Math. Comput., 2019

Imaginary projections of polynomials.
J. Symb. Comput., 2019

An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming.
J. Symb. Comput., 2019

A Polyhedral Homotopy Algorithm For Real Zeros.
CoRR, 2019

Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM Exponentials.
CoRR, 2019

A New Method for Computing Elimination Ideals of Likelihood Equations.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentials.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

New Dependencies of Hierarchies in Polynomial Optimization.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Computing Elimination Ideals and Discriminants of Likelihood Equations.
CoRR, 2018

An Experimental Comparison of SONC and SOS Certificates for Unconstrained Optimization.
CoRR, 2018

2017
A Positivstellensatz for Sums of Nonnegative Circuit Polynomials.
SIAM J. Appl. Algebra Geom., 2017

2016
Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming.
SIAM J. Optim., 2016

2015
Approximating amoebas and coamoebas by sums of squares.
Math. Comput., 2015

Separating inequalities for nonnegative polynomials that are not sums of squares.
J. Symb. Comput., 2015


  Loading...