GloptiPoly
- 1 June 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 29 (2), 165-194
- https://doi.org/10.1145/779359.779363
Abstract
GloptiPoly is a Matlab/SeDuMi add-on to build and solve convex linear matrix inequality relaxations of the (generally nonconvex) global optimization problem of minimizing a multivariable polynomial function subject to polynomial inequality, equality, or integer constraints. It generates a series of lower bounds monotonically converging to the global optimum without any problem splitting. Global optimality is detected and isolated optimal solutions are extracted automatically. Numerical experiments show that for most of the small-scale problems described in the literature, the global optimum is reached at low computational cost.Keywords
This publication has 14 references indexed in Scilit:
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 ProgramsSIAM Journal on Optimization, 2002
- Global Optimization with Polynomials and the Problem of MomentsSIAM Journal on Optimization, 2001
- Computation of a specified root of a polynomial system of equations using eigenvectorsLinear Algebra and its Applications, 2000
- Handbook of Test Problems in Local and Global OptimizationPublished by Springer Science and Business Media LLC ,1999
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- Semidefinite ProgrammingSiam Review, 1996
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming ProblemsSIAM Journal on Discrete Mathematics, 1990
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex ConstraintsManagement Science, 1971