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
A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems, Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming, LP Formulations for Polynomial Optimization Problems, Bounding the parameters of block‐structured nonlinear feedback systems, Algorithm 996, Symmetry Reduction in AM/GM-Based Optimization, Cutting Plane Generation through Sparse Principal Component Analysis, Optimization on the Euclidean Unit Sphere, TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity, Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension, Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures, Optimizing ordered median functions with applications to single facility location, LP relaxations for a class of linear semi-infinite programming problems, Minimizing the sum of many rational functions, Amoebas, nonnegative polynomials and sums of squares supported on circuits, Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, Continuous multifacility ordered median location problems, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, 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, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, 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, Set-membership errors-in-variables identification of MIMO linear systems, Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity, A multilevel analysis of the Lasserre hierarchy, Approximating Pareto curves using semidefinite relaxations, 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, Compatibility, desirability, and the running intersection property, Penalized semidefinite programming for quadratically-constrained quadratic optimization, A sublevel moment-SOS hierarchy for polynomial optimization, Finding unstable periodic orbits: a hybrid approach with polynomial optimization, Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space, A convex optimization approach to synthesizing state feedback data-driven controllers for switched linear systems, New limits of treewidth-based tractability in optimization, Sparse noncommutative polynomial optimization, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, Duality of sum of nonnegative circuit polynomials and optimal SONC bounds, Certifying the global optimality of quartic minimization over the sphere, Exploiting sparsity for the min \(k\)-partition problem, One-shot set-membership identification of generalized Hammerstein-Wiener systems, Exploiting term sparsity in noncommutative polynomial optimization, Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation, Approximate gcds of polynomials and sparse SOS relaxations, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems, A convex relaxation approach to set-membership identification of LPV systems, Solving polynomial least squares problems via semidefinite programming relaxations, Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals, Introduction to Semidefinite, Conic and Polynomial Optimization, Positivity and Optimization: Beyond Polynomials, Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems, Perturbed sums-of-squares theorem for polynomial optimization and its applications, 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
