Pages that link to "Item:Q5757351"
From MaRDI portal
The following pages link to Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity (Q5757351):
Displaying 50 items.
- Minimizing the sum of many rational functions (Q266410) (← links)
- Amoebas, nonnegative polynomials and sums of squares supported on circuits (Q268411) (← links)
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Continuous multifacility ordered median location problems (Q322399) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- Bounded error identification of Hammerstein systems through sparse polynomial optimization (Q361063) (← links)
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity (Q367164) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
- Partitioning procedure for polynomial optimization (Q604960) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- Min-max and robust polynomial optimization (Q652661) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- Moments and sums of squares for polynomial optimization and related problems (Q842714) (← links)
- Modal occupation measures and LMI relaxations for nonlinear switched systems control (Q899277) (← links)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- A semidefinite programming approach to the generalized problem of moments (Q995783) (← links)
- Positive polynomials on projective limits of real algebraic varieties (Q998968) (← links)
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199) (← links)
- A prolongation-projection algorithm for computing the finite real variety of an ideal (Q1029340) (← links)
- Set-membership errors-in-variables identification of MIMO linear systems (Q1640709) (← links)
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- Approximating Pareto curves using semidefinite relaxations (Q1785276) (← links)
- An algorithm for semi-infinite polynomial optimization (Q1935882) (← links)
- Discussion on: ``A decomposition algorithm for KYP-SDPs'' (Q1937317) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Compatibility, desirability, and the running intersection property (Q1989412) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- Finding unstable periodic orbits: a hybrid approach with polynomial optimization (Q2077605) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185) (← links)
- A convex optimization approach to synthesizing state feedback data-driven controllers for switched linear systems (Q2116667) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- One-shot set-membership identification of generalized Hammerstein-Wiener systems (Q2188270) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation (Q2231643) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems (Q2396463) (← links)
