Using Semidefinite Programming to Minimize Polynomials (original) (raw)
Related papers
A “joint+marginal” algorithm for polynomial optimization
49th IEEE Conference on Decision and Control (CDC), 2010
Optimization over polynomials: Selected topics
Solving polynomial least squares problems via semidefinite programming relaxations
Journal of Global Optimization, 2010
Solving polynomial least square problems as polynomial semideflnite programs
Inhomogeneous polynomial optimization over a convex set: An approximation approach
The 2013 Newton Institute Programme on polynomial optimization
Mathematical Programming, 2015
Semidefinite programming in combinatorial and polynomial optimization
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
Mathematics of Operations Research
The empirical performance of a polynomial algorithm for constrained nonlinear optimization
Annals of Operations Research, 1993
Equality Based Contraction of Semidefinite Programming Relaxations in Polynomial Optimization
Journal of the Operations Research Society of Japan, 2008
PENNON: A code for convex nonlinear and semidefinite programming
Optimization Methods and Software, 2003
Global minimization of a multivariate polynomial using matrix methods
Journal of Global optimization, 2003
Convexification of box-constrained polynomial optimization problems via monomial patterns
Cornell University - arXiv, 2019
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
Algebraic Degree of Polynomial Optimization
SIAM Journal on Optimization, 2009
Lectures on Modern Convex Optimization, 2001
Perturbed sums-of-squares theorem for polynomial optimization and its applications
Optimization Methods and Software, 2015
2007
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
2010
Sums of Squares Relaxations of Polynomial Semidefinite Programs
2003
PENLAB: A MATLAB solver for nonlinear semidefinite optimization
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
Moments and sums of squares for polynomial optimization and related problems
Journal of Global Optimization, 2009
A New Strategy For Selecting Subdivision Point In The Bernstein Approach To Polynomial Optimization
Bilevel Polynomial Programs and Semidefinite Relaxation Methods
SIAM Journal on Optimization
Lagrangian-Conic Relaxations, Part II: Applications to Polynomial Optimization Problems
Regularization Methods for Semidefinite Programming
SIAM Journal on Optimization, 2009
Partitioning procedure for polynomial optimization
Journal of Global Optimization, 2010
Approximation Methods for Polynomial Optimization
SpringerBriefs in Optimization, 2012