A neural network approach to solve geometric programs with joint probabilistic constraints
From MaRDI portal
Publication:2104380
DOI10.1016/j.matcom.2022.10.025OpenAlexW4283830990MaRDI QIDQ2104380
Publication date: 7 December 2022
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2022.10.025
ODE systemsLyapunov theorystochastic geometric programmingdynamical neural networkjoint probabilistic constraints optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic system model for solving convex nonlinear optimization problems
- Tractable approximate robust geometric programming
- The commutant lifting approach to interpolation problems
- A deterministic annealing neural network for convex programming
- Stochastic geometric optimization with joint probabilistic constraints
- A second-order cone programming approach for linear programs with joint probabilistic constraints
- Copula theory approach to stochastic geometric programming
- An improved geometric programming approach for optimization of biochemical systems
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Geometric Programming Duals of Channel Capacity and Rate Distortion
- Variational Analysis
This page was built for publication: A neural network approach to solve geometric programs with joint probabilistic constraints