Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
From MaRDI portal
Recommendations
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Lagrangian-conic relaxations. II: Applications to polynomial optimization problems
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
Cited in
(26)- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Recognizing underlying sparsity in optimization
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- An algorithm for the global optimization of a class of continuous minimax problems
- On linear programming relaxations for solving polynomial programming problems
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- A new algorithm for concave quadratic programming
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
- Solving polynomial least squares problems via semidefinite programming relaxations
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Perturbed sums-of-squares theorem for polynomial optimization and its applications
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity
- Lagrangian-conic relaxations. II: Applications to polynomial optimization problems
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
- A polynomial optimization approach to constant rebalanced portfolio selection
- Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations
- Smaller SDP for SOS decomposition
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- Positive polynomials on projective limits of real algebraic varieties
This page was built for publication: Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317519)
