Moments and sums of squares for polynomial optimization and related problems (original) (raw)
Related papers
Sums of squares, moment matrices and optimization over polynomials
2009
POLYNOMIAL OPTIMIZATION AND THE MOMENT PROBLEM
2012
Optimization over polynomials: Selected topics
Global Optimization with Polynomials and the Problem of Moments
SIAM Journal on Optimization, 2001
Perturbed sums-of-squares theorem for polynomial optimization and its applications
Optimization Methods and Software, 2015
Journal of Optimization Theory and Applications, 2015
Sums of Squares Relaxations of Polynomial Semidefinite Programs
2003
Linear Optimization of Polynomial Rational Functions: Applications for Positivity Analysis
Mathematics, 2020
Association for Women in Mathematics Series, 2019
Convexity in semialgebraic geometry and polynomial optimization
2009
Bilinear optimality constraints for the cone of positive polynomials
Mathematical Programming, 2011
Using semidefinite programming to minimize polynomials
Solving polynomial optimization problems via the truncated tangency variety and sums of squares
Journal of Pure and Applied Algebra, 2009
Masakazu Muramatsu, Masakazu Kojima
SIAM Journal on Optimization, 2006
A semidefinite programming approach to the generalized problem of moments
Mathematical Programming, 2007
Solving polynomial least squares problems via semidefinite programming relaxations
Journal of Global Optimization, 2010
A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
SIAM Journal on Optimization, 2011
CONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER D ESIGN
2000
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones
Masakazu Muramatsu, Masakazu Kojima
Mathematical Programming, 2007
Lower bounds for polynomials using geometric programming
Eprint Arxiv 1106 1666, 2011
Mathematical Programming, 2020
Global optimization of polynomials using generalized critical values and sums of squares
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation - ISSAC '10, 2010
Semidefinite programming in combinatorial and polynomial optimization
Masakazu Muramatsu, Masakazu Kojima
2008
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
SIAM Journal on Optimization, 2006
Computability and Complexity of Polynomial Optimization Problems
Lecture Notes in Economics and Mathematical Systems, 1992
Equality Based Contraction of Semidefinite Programming Relaxations in Polynomial Optimization
Journal of the Operations Research Society of Japan, 2008
Solving polynomial least square problems as polynomial semideflnite programs
Real solving polynomial equations with semidefinite programming
2008
A note on the representation of positive polynomials with structured sparsity
2007
Compact Relaxations for Polynomial Programming Problems
Lecture Notes in Computer Science, 2012
A “joint+marginal” algorithm for polynomial optimization
49th IEEE Conference on Decision and Control (CDC), 2010