A vectorized positive semidefinite penalty method for unconstrained binary quadratic programming

DOI10.1007/S10957-025-02883-2MaRDI QIDQ6877954zbMATH OpenFDO

Authors Xinyue Huo, Ran Gu

Publication date 7 January 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-025-02883-2

zbMATH Keywords

proximal point algorithmbinary quadratic programmingpositive semidefinite penalty functionprojection alternating BB stepsize

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cites work

• scientific article; zbMATH DE number 1534299 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A feasible method for general convex low-rank SDP problems
• A note on R-linear convergence of nonmonotone gradient methods
• An entropy-regularized ADMM for binary quadratic programming
• BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Convex Relaxations of (0, 1)-Quadratic Programming
• Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
• Exact SDP relaxations for quadratic programs with bipartite graph structures
• Experiments in quadratic 0-1 programming
• Global optimality conditions for quadratic optimization problems with binary constraints
• Greedy and local search heuristics for unconstrained binary quadratic programming
• Linear vs. quadratic portfolio selection models with hard real-world constraints
• New optimality conditions for quadratic optimization problems with binary constraints
• Positive semidefinite penalty method for quadratically constrained quadratic programming
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• RLT: A unified approach for discrete and continuous nonconvex optimization
• Semidefinite programming relaxation for nonconvex quadratic programs
• Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
• Solving semidefinite-quadratic-linear programs using SDPT3
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• Unconstrained quadratic bivalent programming problem
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem

This page was built for publication: A vectorized positive semidefinite penalty method for unconstrained binary quadratic programming

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