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-ZzbMATH Open1282.90134OpenAlexW2024613035MaRDI QIDQ386447FDOQ386447
Authors: Evrim Dalkiran, Hanif D. Sherali 
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
Recommendations
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Global optimality conditions and optimization methods for polynomial programming problems
- On Solving Polynomial, Factorable, and Black-Box Optimization Problems Using the RLT Methodology
- A rigorous global filtering algorithm for quadratic constraints
- An approximate approach of global optimization for polynomial programming problems
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Global optimality conditions for a class of polynomial integer programming problems with linear constraints
- A Globally Convergent Filter Method for Nonlinear Programming
- Global optimization of nonconvex polynomial programming problems having rational exponents
polynomial programmingbranch-and-boundreformulation-linearization technique (RLT)filtering strategies
Cites Work
- Global optimization with polynomials and the problem of moments
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- A polyhedral branch-and-cut approach to global optimization
- Cones of Matrices and Set-Functions and 0–1 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
- Test examples for nonlinear programming codes
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A convex envelope formula for multilinear functions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex factorable programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Enhancing RLT relaxations via a new class of semidefinite cuts
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Reduced RLT representations for nonconvex polynomial programming problems
- Linearity embedded in nonconvex programs
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
- Dual quadratic estimates in polynomial and Boolean programming
Cited In (7)
- Rigorous filtering using linear relaxations
- 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
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
- On linear programming relaxations for solving polynomial programming problems
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
Uses Software
This page was built for publication: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386447)
