Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems

DOI10.1007/s10957-009-9624-2zbMath1197.90332OpenAlexW2017707310MaRDI QIDQ987509

Berc Rustem, Polyxeni-Margarita Kleniati, Panos Parpas

Publication date: 13 August 2010

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-009-9624-2

zbMATH Keywords

semidefinite programmingBenders decompositionpolynomial optimizationsparse SDP relaxations

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonlinear programming (90C30)

Related Items

Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Partitioning procedure for polynomial optimization, Discussion on: ``A decomposition algorithm for KYP-SDPs, On New Classes of Nonnegative Symmetric Tensors

Uses Software

• CSDP
• SDPA
• SeDuMi
• lp_solve
• SparsePOP
• DSDP5
• CHOLMOD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parallel interior point decomposition algorithm for block angular semidefinite programs
• Recognizing underlying sparsity in optimization
• A collection of test problems for constrained global optimization algorithms
• Topics in semidefinite and interior-point methods
• Semidefinite programming relaxations for semialgebraic problems
• Some geometric results in semidefinite programming
• Partitioning procedures for solving mixed-variables programming problems. Reprint
• Generalized Benders decomposition
• Global Optimization with Polynomials and the Problem of Moments
• Algorithm 875
• CSDP, A C library for semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• An Interior-Point Method for Semidefinite Programming
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• The Validity of a Family of Optimization Methods
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs