Sharp-peak functions enable exact penalization of binary constraints, with global minimizers of the penalty model coinciding with UBIP solutions above a threshold, supported by a linearly convergent ADMM-based algorithm to P-stationary points.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sharp-Peak Functions for Exactly Penalizing Binary Integer Programming
Sharp-peak functions enable exact penalization of binary constraints, with global minimizers of the penalty model coinciding with UBIP solutions above a threshold, supported by a linearly convergent ADMM-based algorithm to P-stationary points.