Partitioning procedure for polynomial optimization

DOI10.1007/s10898-010-9529-5zbMath1226.90077OpenAlexW2029406327MaRDI QIDQ604960

Polyxeni-Margarita Kleniati, Panos Parpas, Berc Rustem

Publication date: 12 November 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9529-5

zbMATH Keywords

Benders decompositionPositivstellensatzpolynomial optimizationsum of squares

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (6)

Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets ⋮ Two methods for the maximization of homogeneous polynomials over the simplex ⋮ A robust unscented transformation for uncertain moments ⋮ On cones of nonnegative quartic forms ⋮ Alternative SDP and SOCP approximations for polynomial optimization ⋮ Inhomogeneous polynomial optimization over a convex set: An approximation approach

Uses Software

• SeDuMi
• GloptiPoly
• GLOBALLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of Putinar's Positivstellensatz
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
• The \(K\)-moment problem for compact semi-algebraic sets
• Unconstrained and constrained global optimization of polynomial functions in one variable
• A collection of test problems for constrained global optimization algorithms
• Semidefinite programming relaxations for semialgebraic problems
• Partitioning procedures for solving mixed-variables programming problems. Reprint
• Generalized Benders decomposition
• Global Optimization with Polynomials and the Problem of Moments
• Lectures on Modern Convex Optimization
• A resource decomposition algorithm for general mathematical programs
• An elementary survey of general duality theory in mathematical programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Optimization of Polynomials on Compact Semialgebraic Sets
• GloptiPoly
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• The Validity of a Family of Optimization Methods
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Point-to-Set Maps in Mathematical Programming
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• Convex analysis and global optimization

This page was built for publication: Partitioning procedure for polynomial optimization