Enhancing RLT relaxations via a new class of semidefinite cuts
From MaRDI portal
Publication:598599
DOI10.1023/A:1013819515732zbMath1045.90044MaRDI QIDQ598599
Barbara M. P. Fraticelli, Hanif D. Sherali
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Nonconvex quadratic programmingReformulation-Linearization Technique (RLT)Semidefinite cutsSemidefinite programming (SDP)Valid inequalities
Related Items (38)
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ Linear Programming Relaxations of Quadratically Constrained Quadratic Programs ⋮ Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems ⋮ The Boolean Quadric Polytope ⋮ A review of recent advances in global optimization ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations ⋮ RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality ⋮ Computational study of a branching algorithm for the maximum \(k\)-cut problem ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs ⋮ Convex Maximization via Adjustable Robust Optimization ⋮ Gap inequalities for non-convex mixed-integer quadratic programs ⋮ Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming ⋮ Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods ⋮ Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ A reformulation-linearization technique for optimization over simplices ⋮ Reduced RLT representations for nonconvex polynomial programming problems ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ On linear programs with linear complementarity constraints ⋮ Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts ⋮ Optimization over structured subsets of positive semidefinite matrices via column generation ⋮ Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems ⋮ A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations ⋮ RLT: A unified approach for discrete and continuous nonconvex optimization ⋮ Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints ⋮ 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 ⋮ Template polyhedra and bilinear optimization ⋮ A new separation algorithm for the Boolean quadric and cut polytopes ⋮ Fabrication-Adaptive Optimization with an Application to Photonic Crystal Design ⋮ On generalized surrogate duality in mixed-integer nonlinear programming
Uses Software
This page was built for publication: Enhancing RLT relaxations via a new class of semidefinite cuts
