GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi

被引:225
作者
Henrion, D
Lasserre, JB
机构
[1] CNRS, LAAS, F-31077 Toulouse, France
[2] Acad Sci Czech Republ, Inst Informat Theory & Automat, CR-18208 Prague, Czech Republic
来源
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 2003年 / 29卷 / 02期
关键词
algorithms; documentation; experimentation; polynomial programming; semidefinite programming; linear matrix inequality; Matlab; SeDuMi;
D O I
10.1145/779359.779363
中图分类号
TP31 [计算机软件];
学科分类号
081202 [计算机软件与理论]; 0835 [软件工程];
摘要
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.
引用
收藏
页码:165 / 194
页数:30
相关论文
共 24 条
[1]
ANJOS M, 2001, THESIS WATERLOO U WA
[2]
[Anonymous], 1998, NONDIFFERENTIABLE OP
[3]
BENSAAD S, 1989, THESIS U CALIFORNIA
[4]
Computation of a specified root of a polynomial system of equations using eigenvectors [J].
Bondyfalat, D ;
Mourrain, B ;
Pan, VY .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2000, 319 (1-3) :193-209
[5]
Corless R.M., 1997, P INT S SYMBOLIC ALG, P133
[6]
FLOUDAS CA, 1999, HDB TEST PROBLEMS LO
[7]
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming [J].
Goemans, MX ;
Williamson, DP .
JOURNAL OF THE ACM, 1995, 42 (06) :1115-1145
[8]
LMI approximations for the radius of the intersection of ellipsoids: Survey [J].
Henrion, D ;
Tarbouriech, S ;
Arzelier, D .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2001, 108 (01) :1-28
[9]
Polynomials nonnegative on a grid and discrete optimization [J].
Lasserre, JB .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2002, 354 (02) :631-649
[10]
An explicit equivalent positive semidefinite program for nonlinear 0-1 programs [J].
Lasserre, JB .
SIAM JOURNAL ON OPTIMIZATION, 2002, 12 (03) :756-769