Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
From MaRDI portal
Publication:386447
DOI10.1007/s10898-012-0024-zzbMath1282.90134OpenAlexW2024613035MaRDI QIDQ386447
Hanif D. Sherali, Evrim Dalkiran
Publication date: 9 December 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-0024-z
branch-and-boundpolynomial programmingreformulation-linearization technique (RLT)filtering strategies
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, On linear programming relaxations for solving polynomial programming problems, Computational advances in polynomial optimization: RAPOSa, a freely available global solver
Uses Software
Cites Work
- 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
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Test examples for nonlinear programming codes
- 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
- A convex envelope formula for multilinear functions
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Linearity embedded in nonconvex programs
- Global Optimization with Polynomials and the Problem of Moments
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Jointly Constrained Biconvex Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Global optimization of nonconvex factorable programming problems
