Pages that link to "Item:Q5757351"
From MaRDI portal
The following pages link to Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity (Q5757351):
Displayed 29 items.
- 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)
- 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)
- 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)
- 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)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- Improved parameter bounds for set-membership EIV problems (Q3008831) (← links)
- Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets (Q3451759) (← links)
- SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS (Q3560105) (← links)
- Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares (Q3576578) (← links)
- Bounding the parameters of block‐structured nonlinear feedback systems (Q4921760) (← links)
- Optimizing ordered median functions with applications to single facility location (Q5176324) (← links)