Using general triangle inequalities within quadratic convex reformulation method

DOI10.1080/10556788.2022.2157002zbMath1528.90176OpenAlexW4312032865MaRDI QIDQ6175568

Amélie Lambert

Publication date: 24 July 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2022.2157002

zbMATH Keywords

global optimizationquadratic programmingsemi-definite programmingvalid inequalitiesLagrangian dualitysub-gradient algorithmquadratic convex relaxation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Quadratic programming (90C20)

Cites Work

• Unnamed Item
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• GLOMIQO: global mixed-integer quadratic optimizer
• Extending the QCR method to general mixed-integer programs
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• A polyhedral approach for nonconvex quadratic programming problems with box constraints
• Process planning in a fuzzy environment
• Packing equal circles in a square: A deterministic global optimization approach
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
• Globally solving nonconvex quadratic programming problems via completely positive programming
• A polyhedral study of nonconvex quadratic programs with box constraints
• 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
• Dynamic bundle methods
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
• Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
• On Nonconvex Quadratic Programming with Box Constraints
• Quadratically constrained quadratic programming: Some applications and a method for solution
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• CSDP, A C library for semidefinite programming
• Global solution of non-convex quadratically constrained quadratic programs
• Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
• Benchmarking optimization software with performance profiles.

This page was built for publication: Using general triangle inequalities within quadratic convex reformulation method