Exploiting sparsity in SDP relaxation of polynomial optimization problems
From MaRDI portal
Publication:2802536
Recommendations
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- SDP relaxations for quadratic optimization problems derived from 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
- EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1489802 (Why is no real title available?)
- scientific article; zbMATH DE number 753805 (Why is no real title available?)
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- GLOBALLib
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Global optimization with polynomials and the problem of moments
- Matlab
- Moments, positive polynomials and their applications
- SDPLIB 1.2, a library of semidefinite programming test problems
- Solving semidefinite-quadratic-linear programs using SDPT3
- Sparsity in sums of squares of polynomials
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Testing Unconstrained Optimization Software
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(15)- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- An extension of the elimination method for a sparse SOS polynomial
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- SDP relaxations for quadratic optimization problems derived from polynomial optimization problems
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Recognizing underlying sparsity in optimization
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Exploiting structured sparsity in large scale semidefinite programming problems
- Solving partial differential equations via sparse SDP relaxations
- Algorithm 996
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Exploiting term sparsity in noncommutative polynomial optimization
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
Describes a project that uses
Uses Software
This page was built for publication: Exploiting sparsity in SDP relaxation of polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802536)
