Distributionally Robust Geometric Joint Chance-Constrained Optimization: Neurodynamic Approaches
About
This paper proposes a two-time scale neurodynamic duplex approach to solve distributionally robust geometric joint chance-constrained optimization problems. The probability distributions of the row vectors are not known in advance and belong to a certain distributional uncertainty set. In our paper, we study three uncertainty sets for the unknown distributions. The neurodynamic duplex is designed based on three projection equations. The main contribution of our work is to propose a neural network-based method to solve distributionally robust joint chance-constrained optimization problems that converges in probability to the global optimum without the use of standard state-of-the-art solving methods. We show that neural networks can be used to solve multiple instances of a problem. In the numerical experiments, we apply the proposed approach to solve a problem of shape optimisation and a telecommunication problem.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Joint-constrained geometric optimization | POJ problem | Objective Value29.03 | 12 | |
| Joint-constrained geometric optimization | POJ multiple instances | CPU Time (s)4.85 | 10 | |
| SINR Maximization | MaMIMO systems | Objective Value4.14 | 4 | |
| Violation analysis | Uniform distribution scenarios | Violations Count0.00e+0 | 4 | |
| Violation analysis | Normal distribution scenarios | Violated Scenarios Count0.00e+0 | 4 | |
| Violation analysis | Logistic distribution scenarios | Violated Scenarios Count0.00e+0 | 4 | |
| Violation analysis | Gamma distribution scenarios | Violated Scenarios Count2 | 4 | |
| Violation analysis | Log-normal distribution scenarios | Violated Scenarios Count2 | 4 |