Pages that link to "Item:Q598599"
From MaRDI portal
The following pages link to Enhancing RLT relaxations via a new class of semidefinite cuts (Q598599):
Displayed 23 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
- Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- Fabrication-Adaptive Optimization with an Application to Photonic Crystal Design (Q2875611) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)