Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
From MaRDI portal
Publication:1029700
DOI10.1007/s10898-008-9372-0zbMath1169.90425MaRDI QIDQ1029700
Publication date: 13 July 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9372-0
Related Items
Combining qualitative information and semi‐quantitative data for guaranteed invalidation of biochemical network models, Adaptive computable approximation to cones of nonnegative quadratic functions, GLOMIQO: global mixed-integer quadratic optimizer, Semidefinite relaxations for non-convex quadratic mixed-integer programming, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, Copositivity and constrained fractional quadratic problems, Gap inequalities for non-convex mixed-integer quadratic programs, Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts, Relaxing the optimality conditions of box QP, Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, Burer's key assumption for semidefinite and doubly nonnegative relaxations, Solution existence and stability of quadratically constrained convex quadratic programs, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, On convex relaxations for quadratically constrained quadratic programming, Branch and cut algorithms for detecting critical nodes in undirected graphs, An outer-approximation approach for information-maximizing sensor selection, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Valid constraints for the Point Packing in a Square problem, Computable representations for convex hulls of low-dimensional quadratic forms, Disjunctive Cuts for Nonconvex MINLP, Linear Programming Relaxations of Quadratically Constrained Quadratic Programs, Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
Uses Software
Cites Work
- Unnamed Item
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Theory of semidefinite programming for sensor network localization
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Approximating quadratic programming with bound and quadratic constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- BARON: A general purpose global optimization software package
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Global Optimization in Geometry — Circle Packing into the Square
- Handbook of semidefinite programming. Theory, algorithms, and applications
