Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts
From MaRDI portal
Publication:453612
DOI10.1007/S10589-011-9425-ZzbMATH Open1250.90092OpenAlexW2027109023MaRDI QIDQ453612FDOQ453612
Authors: Hanif D. Sherali, Evrim Dalkiran, Jitamitra Desai 
Publication date: 27 September 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9425-z
Recommendations
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
- Reduced RLT representations for nonconvex polynomial programming problems
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
global optimizationsemidefinite programmingreformulation-linearization techniqueBARONpolynomial programssemidefinite cutsGloptiPoly
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- 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
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- Nonlinear Programming
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- More test examples for nonlinear programming codes
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Handbook of test problems in local and global optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Global optimization of nonconvex factorable programming problems
- Nondifferentiable optimization and polynomial problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Enhancing RLT relaxations via a new class of semidefinite cuts
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Semidefinite programming and integer programming
- Dual quadratic estimates in polynomial and Boolean programming
- Semidefinite programming
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications
- On the finite convergence of successive SDP relaxation methods
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
Cited In (11)
- Partial Lasserre relaxation for sparse Max-Cut
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Extended formulations for convex envelopes
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Reduced RLT representations for nonconvex polynomial programming problems
- 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
- A global optimization framework for distributed antenna location in CDMA cellular networks
- 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: Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453612)
