RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems

DOI10.1007/s12532-016-0099-5zbMath1353.65052OpenAlexW2415917885MaRDI QIDQ340017

Evrim Dalkiran, Hanif D. Sherali

Publication date: 11 November 2016

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-016-0099-5

zbMATH Keywords

algorithmnumerical examplenonconvex optimizationfilteringvalid inequalitiespolynomial programmingreformulation-linearization technique (RLT)comparison of software packagesconstraint filtering strategiesopen-source codereduced RLT representations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Packaged methods for numerical algorithms (65Y15)

Related Items

On linear programming relaxations for solving polynomial programming problems, Error bounds for monomial convexification in polynomial optimization, Efficient linear reformulations for binary polynomial optimization problems, Computational advances in polynomial optimization: RAPOSa, a freely available global solver, RLT-POS

Uses Software

• BARON
• Matlab
• SNOPT
• SeDuMi
• CPLEX
• SparsePOP
• Couenne
• alphaBB

Cites Work

• Unnamed Item
• Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
• Reduced RLT representations for nonconvex polynomial programming problems
• Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
• Enhancing RLT relaxations via a new class of semidefinite cuts
• Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
• A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Test examples for nonlinear programming codes
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
• A polyhedral branch-and-cut approach to global optimization
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• A branch-and-reduce approach to global optimization
• On convex relaxations for quadratically constrained quadratic programming
• Global optimization of general nonconvex problems with intermediate polynomial substructures
• Linearity embedded in nonconvex programs
• Branching and bounds tighteningtechniques for non-convex MINLP
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Nonlinear Programming
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• Global optimization of nonconvex factorable programming problems