11 citations · 22 across the 11 of their papers we have counts for
8 papers · 1 filter
A Bounded Degree SOS Plus SONC Hierarchy for Polynomial Optimization
Mareike Dressler, Qi Wang
We propose a bounded degree SOS+SONC hierarchy for constrained polynomial optimization, termed B-SOS+SONC. Starting from Lasserre's bounded-degree SOS framework, we enlarge the cer…
Algebraic optimization of sequential decision problems
Mareike Dressler, Marina Garrote-López, Guido Montúfar +2
We study the optimization of the expected long-term reward in finite partially observable Markov decision processes over the set of stationary stochastic policies. In the case of d…
Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization
Antonio Bellon, Mareike Dressler, Vyacheslav Kungurtsev +2
We present an online algorithm for time-varying semidefinite programs (TV-SDPs), based on the tracking of the solution trajectory of a low-rank matrix factorization, also known as…
Kronecker Product Approximation of Operators in Spectral Norm via Alternating SDP
Mareike Dressler, André Uschmajew, Venkat Chandrasekaran
The decomposition or approximation of a linear operator on a matrix space as a sum of Kronecker products plays an important role in matrix equations and low-rank modeling. The appr…
Separability of Hermitian Tensors and PSD Decompositions
Mareike Dressler, Jiawang Nie, Zi Yang
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decompositi…
Global Optimization via the Dual SONC Cone and Linear Programming
Mareike Dressler, Janin Heuer, Helen Naumann +1
Using the dual cone of sums of nonnegative circuits (SONC), we provide a relaxation of the global optimization problem to minimize an exponential sum and, as a special case, a mult…
The dual cone of sums of non-negative circuit polynomials
Mareike Dressler, Helen Naumann, Thorsten Theobald
For a non-empty, finite subset , denote by the cone of sums of non-negative ci…
An Approach to Constrained Polynomial Optimization via Nonnegative Circuit Polynomials and Geometric Programming
Mareike Dressler, Sadik Iliman, Timo de Wolff
In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, wh…