default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMareike Dressler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Mareike Dressler, Marina Garrote-López
, Guido Montúfar, Johannes Müller, Kemal Rose:
Algebraic optimization of sequential decision problems. J. Symb. Comput. 121: 102241 (2024)- [j6]Antonio Bellon, Mareike Dressler, Vyacheslav Kungurtsev, Jakub Marecek, André Uschmajew:
Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization. SIAM J. Optim. 34(1): 1-26 (2024) - [i5]Mareike Dressler, Simon Foucart, Etienne de Klerk, Mioara Joldes, Jean-Bernard Lasserre, Yuan Xu:
Optimization-Aided Construction of Multivariate Chebyshev Polynomials. CoRR abs/2405.10438 (2024) - 2023
- [j5]Mareike Dressler, André Uschmajew, Venkat Chandrasekaran:
Kronecker Product Approximation of Operators in Spectral Norm via Alternating SDP. SIAM J. Matrix Anal. Appl. 44(4): 1693-1708 (2023) - 2022
- [j4]Mareike Dressler, Adam Kurpisz, Timo de Wolff:
Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials. Found. Comput. Math. 22(2): 365-387 (2022) - [j3]Mareike Dressler, Riley Murray:
Algebraic Perspectives on Signomial Optimization. SIAM J. Appl. Algebra Geom. 6(1): 650-684 (2022) - [i4]Mareike Dressler, André Uschmajew, Venkat Chandrasekaran:
Kronecker Product Approximation of Operators in Spectral Norm via Alternating SDP. CoRR abs/2207.03186 (2022) - [i3]Antonio Bellon, Mareike Dressler, Vyacheslav Kungurtsev, Jakub Marecek, André Uschmajew:
Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization. CoRR abs/2210.08387 (2022) - [i2]Mareike Dressler, Marina Garrote-López, Guido Montúfar, Johannes Müller, Kemal Rose:
Algebraic optimization of sequential decision problems. CoRR abs/2211.09439 (2022) - 2020
- [c2]Mareike Dressler, Janin Heuer, Helen Naumann, Timo de Wolff:
Global optimization via the dual SONC cone and linear programming. ISSAC 2020: 138-145
2010 – 2019
- 2019
- [j2]Mareike Dressler, Sadik Iliman, Timo de Wolff:
An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming. J. Symb. Comput. 91: 149-172 (2019) - 2018
- [b1]Mareike Dressler:
Sums of nonnegative circuit polynomials: geometry and optimization. Goethe University Frankfurt, Frankfurt am Main, Germany, 2018 - [c1]Mareike Dressler, Adam Kurpisz, Timo de Wolff:
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. MFCS 2018: 82:1-82:17 - [i1]Mareike Dressler, Adam Kurpisz, Timo de Wolff:
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. CoRR abs/1802.10004 (2018) - 2017
- [j1]Mareike Dressler, Sadik Iliman, Timo de Wolff:
A Positivstellensatz for Sums of Nonnegative Circuit Polynomials. SIAM J. Appl. Algebra Geom. 1(1): 536-555 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
