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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Proximal Basin Hopping combines proximal steps and local minimization to produce a global optimizer with high-probability convergence using finite samples.
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.
-
Proximal basin hopping: global optimization with guarantees
Proximal Basin Hopping combines proximal steps and local minimization to produce a global optimizer with high-probability convergence using finite samples.