Using general triangle inequalities within quadratic convex reformulation method
From MaRDI portal
Publication:6175568
Recommendations
- scientific article; zbMATH DE number 1560357
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- On convex relaxations for quadratically constrained quadratic programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
Cites work
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A polyhedral study of nonconvex quadratic programs with box constraints
- Benchmarking optimization software with performance profiles.
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- CSDP, A C library for semidefinite programming
- Dynamic bundle methods
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Extending the QCR method to general mixed-integer programs
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Global solution of non-convex quadratically constrained quadratic programs
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- GLOMIQO: global mixed-integer quadratic optimizer
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- On nonconvex quadratic programming with box constraints
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Packing equal circles in a square: A deterministic global optimization approach
- Process planning in a fuzzy environment
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
Cited in
(1)
This page was built for publication: Using general triangle inequalities within quadratic convex reformulation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175568)
