A fast global algorithm for multi-linearly constrained separable binary quadratic program

DOI10.3934/JIMO.2024132MaRDI QIDQ6850336zbMATH OpenFDO

Authors Guangtai Qu, Shaoze Li, Zhibin Deng, Cheng Lu

Publication date 3 March 2026

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/JIMO.2024132

zbMATH Keywords

branch-and-boundmixed-integer quadratic programmingcoordinate ascent

Mathematics Subject Classification ID

Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Cites work

• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
• A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
• Convex Analysis
• Coordinate descent algorithms
• Covering a line segment with variable radius discs
• Demand allocation with latency cost functions
• Fast computation of global solutions to the single-period unit commitment problem
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Perspective reformulation and applications
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• Projected perspective reformulations with applications in design problems

This page was built for publication: A fast global algorithm for multi-linearly constrained separable binary quadratic program

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6850336)