Exploiting sparsity in SDP relaxation of polynomial optimization problems
From MaRDI portal
Publication:2802536
DOI10.1007/978-1-4614-0769-0_18zbMATH Open1334.90107OpenAlexW153356565MaRDI QIDQ2802536FDOQ2802536
Authors: Sunyoung Kim, Masakazu Kojima 
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_18
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
Applications of mathematical programming (90C90) Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- Matlab
- GLOBALLib
- Testing Unconstrained Optimization Software
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Solving semidefinite-quadratic-linear programs using SDPT3
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Moments, positive polynomials and their applications
- Title not available (Why is that?)
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- 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
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Title not available (Why is that?)
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- Title not available (Why is that?)
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Sparsity in sums of squares of polynomials
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
Cited In (14)
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- An extension of the elimination method for a sparse SOS polynomial
- 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
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
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)
