.png){kind=icon}
.png){kind=icon}
Return
A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
.png){kind=icon}
PRE
AI
DOI：10.1007/s10957-025-02883-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The unconstrained binary quadratic programming (UBQP) problem is a class of problems of significant importance in many practical applications, such as in combinatorial optimization, circuit design, and other fields. The positive semidefinite penalty (PSDP) method originated from research on semidefinite relaxation, where the introduction of an exact penalty function improves the efficiency and accuracy of problem solving. In this paper, we propose a vectorized PSDP method for solving the UBQP problem, which optimizes computational efficiency by vectorizing matrix variables within a PSDP framework. Algorithmic enhancements in penalty updating and initialization are implemented, along with the introduction of two algorithms that integrate the proximal point algorithm and the projection alternating BB method for subproblem resolution. Properties of the penalty function and algorithm convergence are analyzed. Numerical experiments show the superior performance of the method in providing high-quality solutions and satisfactory solution times compared to the semidefinite relaxation method and other established methods.
Keywords:
Binary quadratic programming
Positive semidefinite penalty function
Proximal point algorithm
Projection alternating BB stepsize
Journal
J
IF:
1.5
Papers:
178
Citations:
8.2K