Reduced RLT representations for nonconvex polynomial programming problems
From MaRDI portal
Publication:427362
DOI10.1007/s10898-011-9757-3zbMath1244.90185OpenAlexW1972384851MaRDI QIDQ427362
Evrim Dalkiran, Hanif D. Sherali, Leo Liberti
Publication date: 13 June 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9757-3
global optimizationreformulation-linearization technique (RLT)BARONpolynomial programsreduced basis techniquessemidefinite cuts
Related Items
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, GLOMIQO: global mixed-integer quadratic optimizer, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, Error bounds for monomial convexification in polynomial optimization, A framework for globally optimizing mixed-integer signomial programs, Efficient separation of RLT cuts for implicit and explicit bilinear products, Computational advances in polynomial optimization: RAPOSa, a freely available global solver, Extended formulations for convex envelopes, LP Formulations for Polynomial Optimization Problems, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations, Template polyhedra and bilinear optimization
Uses Software
Cites Work
- Unnamed Item
- 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
- Dual quadratic estimates in polynomial and Boolean programming
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- A polyhedral branch-and-cut approach to global optimization
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A branch-and-reduce approach to global optimization
- Global optimization problems and domain reduction strategies
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- Linearity embedded in nonconvex programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
