activity
20162026
most citedGlobal Optimization via the Dual SONC Cone and Linear Programming

11 citations · 22 across the 11 of their papers we have counts for

collaborators

14 papers

math.OC2026

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…

math.AG2023

Geometrical Study of the Cone of Sums of Squares plus Sums of Nonnegative Circuits

Mareike Dressler, Salma Kuhlmann, Moritz Schick

In this article, we combine sums of squares (SOS) and sums of nonnegative circuit (SONC) forms, two independent nonnegativity certificates for real homogeneous polynomials. We cons…

math.OC2022

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…

math.OC2022★ 3 cited

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…

math.OC2022

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…

math.AG2021★ 1 cited

Algebraic perspectives on signomial optimization

Mareike Dressler, Riley Murray

Signomials are obtained by generalizing polynomials to allow for arbitrary real exponents. This generalization offers great expressive power, but has historically sacrificed the or…

math.OC2020★ 2 cited

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…

math.AG2020★ 1 cited

Multiple typical ranks in matrix completion

Mareike Dressler, Robert Krone

Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry patter…

math.OC2020★ 11 cited

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…

math.AG2019★ 3 cited

Real Zeros of SONC Polynomials

Mareike Dressler

We provide a complete and explicit characterization of the real zeros of sums of nonnegative circuit (SONC) polynomials, a recent certificate for nonnegative polynomials independen…

math.OC2018

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…

cs.DS2018★ 1 cited

Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials

Mareike Dressler, Adam Kurpisz, Timo de Wolff

Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove com…

math.AG2016

A Positivstellensatz for Sums of Nonnegative Circuit Polynomials

Mareike Dressler, Sadik Iliman, Timo de Wolff

Recently, the second and the third author developed sums of nonnegative circuit polynomials (SONC) as a new certificate of nonnegativity for real polynomials, which is independent…

math.OC2016

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…