Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
From MaRDI portal
Publication:5757351
DOI10.1137/05064504XzbMath1119.90036MaRDI QIDQ5757351
Publication date: 6 September 2007
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Related Items
Bounding the parameters of block‐structured nonlinear feedback systems, Optimizing ordered median functions with applications to single facility location, Bounded error identification of Hammerstein systems through sparse polynomial optimization, Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, The \(\mathcal A\)-truncated \(K\)-moment problem, Partitioning procedure for polynomial optimization, Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\), Min-max and robust polynomial optimization, Semidefinite programming for min-max problems and games, A polynomial optimization approach to constant rebalanced portfolio selection, Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion, Moments and sums of squares for polynomial optimization and related problems, Modal occupation measures and LMI relaxations for nonlinear switched systems control, Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems, A semidefinite programming approach to the generalized problem of moments, Positive polynomials on projective limits of real algebraic varieties, A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones, A prolongation-projection algorithm for computing the finite real variety of an ideal, An algorithm for semi-infinite polynomial optimization, Discussion on: ``A decomposition algorithm for KYP-SDPs, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, Approximate gcds of polynomials and sparse SOS relaxations, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, Solving polynomial least squares problems via semidefinite programming relaxations, Improved parameter bounds for set-membership EIV problems, Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets, SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS, Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares
