Markus Schweighofer

According to our database1, Markus Schweighofer authored at least 13 papers between 2004 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Exact SOHS Decompositions of Trigonometric Univariate Polynomials with Gaussian Coefficients.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2019
Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials.
J. Symb. Comput., 2019

On the Exactness of Lasserre Relaxations and Pure States Over Real Closed Fields.
Found. Comput. Math., 2019

2018
On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets.
SIAM J. Optim., 2018

Optimization approaches to quadrature: New characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions.
J. Complex., 2018

2017
Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials.
CoRR, 2017

2013
An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares.
Math. Oper. Res., 2013

2010
Exposed Faces of Semidefinitely Representable Sets.
SIAM J. Optim., 2010

2009
Describing convex semialgebraic sets by linear matrix inequalities.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2007
On the complexity of Putinar's Positivstellensatz.
J. Complex., 2007

2006
Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares.
SIAM J. Optim., 2006

2005
Optimization of Polynomials on Compact Semialgebraic Sets.
SIAM J. Optim., 2005

2004
On the complexity of Schmu"dgen's Positivstellensatz.
J. Complex., 2004


  Loading...