Papers › Softplus Penalty Functions for Constrained Optimization
Softplus Penalty Functions for Constrained Optimization
Stefan Meili
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Penalty functions are widely used to enforce constraints in optimization problems and reinforcement leaning algorithms. Softplus and algebraic penalty functions are proposed to overcome the sensitivity of the Courant-Beltrami method to strong objective function gradients. These penalty functions are shown to converge in one fifth as many iterations on problems with fifty optimized parameters and be less sensitive to objective function gradient and scaling than the Courant-Beltrami penalty function. The softplus and algebraic penalty functions developed in this work allow optimized solutions to be found in fewer iterations with greater control over constraint accuracy.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections