# A Sigmoidal Approximation for Chance-Constrained Nonlinear Programs

arXiv: https://arxiv.org/abs/2004.02402 · HTML: https://mlsanity.com/paper/2004.02402/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Apr 2020.

## Built on by (most cited first, 4 of 4)

- [WISK: A Workload-aware Learned Index for Spatial Keyword Queries](https://mlsanity.com/paper/2302.14287/) (2023)
- [Physics-Informed Graph Neural Network for Dynamic Reconfiguration of Power Systems](https://mlsanity.com/paper/2310.00728/) (2023)
- [Grid-SiPhyR: An end-to-end learning to optimize framework for combinatorial problems in power systems](https://mlsanity.com/paper/2206.06789/) (2022)
- [SteinGate: Tail-Sensitive Safe Reinforcement Learning via Stein Discrepancy](https://mlsanity.com/paper/2607.13175/) (2026)

## Abstract (arXiv)

We propose a sigmoidal approximation for the value-at-risk (that we call SigVaR) and we use this approximation to tackle nonlinear programs (NLPs) with chance constraints. We prove that the approximation is conservative and that the level of conservatism can be made arbitrarily small for limiting parameter values. The SigVar approximation brings scalability benefits over exact mixed-integer reformulations because its sample average approximation can be cast as a standard NLP. We also establish explicit connections between SigVaR and other smooth sigmoidal approximations recently reported in the literature. We show that a key benefit of SigVaR over such approximations is that one can establish an explicit connection with the conditional value at risk (CVaR) approximation and exploit this connection to obtain initial guesses for the approximation parameters. We present small- and large-scale numerical studies to illustrate the developments.