RLT-POS: Reformulation-Linearization Technique-based optimization software for solving polynomial programming problems

In this paper, we introduce a Reformulation-Linearization Technique-based open-source optimization software for solving polynomial programming problems (RLT-POS). We present algorithms and mechanisms that form the backbone of RLT-POS, including constraint filtering techniques, reduced RLT representations, and semidefinite cuts. When implemented individually, each model enhancement has been shown in previous papers to significantly improve the performance of the standard RLT procedure. However, the coordination between different model enhancement techniques becomes critical for an improved overall performance since special structures in the original formulation that work in favor of a particular technique might be lost after implementing some other model enhancement. More specifically, we discuss the coordination between (1) constraint elimination via filtering techniques and reduced RLT representations, and (2) semidefinite cuts for sparse problems. We present computational results using instances from the literature as well as randomly generated problems to demonstrate the improvement over a standard RLT implementation and to compare the performances of the software packages BARON, COUENNE, and SparsePOP with RLT-POS.

[1]  Hanif D. Sherali,et al.  Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs , 2011, J. Glob. Optim..

[2]  Hanif D. Sherali,et al.  Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts , 2012, Comput. Optim. Appl..

[3]  Leo Liberti.  Linearity Embedded in Nonconvex Programs , 2005, J. Glob. Optim..

[4]  Hanif D. Sherali,et al.  Enhancing RLT relaxations via a new class of semidefinite cuts , 2002, J. Glob. Optim..

[5]  Hanif D. Sherali,et al.  A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique , 1992, J. Glob. Optim..

[6]  Kurt M. Anstreicher,et al.  Institute for Mathematical Physics Semidefinite Programming versus the Reformulation–linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming Semidefinite Programming versus the Reformulation-linearization Technique for Nonconvex Quadratically Constrained , 2022 .

[7]  Pierre Hansen,et al.  Compact Relaxations for Polynomial Programming Problems , 2012, SEA.

[8]  Franz Rendl,et al.  Semidefinite programming and integer programming , 2002 .

[9]  Masakazu Muramatsu,et al.  SparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems , 2005 .

[10]  Kurt M. Anstreicher,et al.  On convex relaxations for quadratically constrained quadratic programming , 2012, Math. Program..

[11]  Leo Liberti,et al.  Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..

[12]  Jean B. Lasserre,et al.  Semidefinite Programming vs. LP Relaxations for Polynomial Programming , 2002, Math. Oper. Res..

[13]  Jean B. Lasserre,et al.  Convergent SDP-Relaxations in Polynomial Optimization with Sparsity , 2006, SIAM J. Optim..

[14]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[15]  Hanif D. Sherali,et al.  A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions , 2009, Discret. Appl. Math..

[16]  Hanif D. Sherali,et al.  Reduced RLT representations for nonconvex polynomial programming problems , 2012, J. Glob. Optim..

[17]  Hanif D. Sherali,et al.  New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems , 1997, Oper. Res. Lett..

[18]  Hanif D. Sherali,et al.  Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality , 2013, J. Glob. Optim..

[19]  Hanif D. Sherali,et al.  Global optimization of nonconvex factorable programming problems , 2001, Math. Program..

[20]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[21]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[22]  Christodoulos A. Floudas,et al.  αBB: A global optimization method for general constrained nonconvex problems , 1995, J. Glob. Optim..

[23]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..

[24]  Masakazu Muramatsu,et al.  Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity , 2004 .

[25]  Willi Hock,et al.  Lecture Notes in Economics and Mathematical Systems , 1981 .

[26]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[27]  Leo Liberti,et al.  An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms , 2006, J. Glob. Optim..

[28]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[29]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[30]  Nikolaos V. Sahinidis,et al.  A branch-and-reduce approach to global optimization , 1996, J. Glob. Optim..

[31]  Nikolaos V. Sahinidis,et al.  Global optimization of general non-convex problems with intermediate bilinear substructures , 2014, Optim. Methods Softw..