Pages that link to "Item:Q5317519"
From MaRDI portal
The following pages link to Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems (Q5317519):
Displayed 15 items.
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity (Q367164) (← links)
- A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← 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)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- An algorithm for the global optimization of a class of continuous minimax problems (Q1028590) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- Global optimality conditions and optimization methods for constrained polynomial programming problems (Q1663418) (← links)
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems (Q2396463) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536) (← links)
- Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)