A neural network approach to solve geometric programs with joint probabilistic constraints
From MaRDI portal
Publication:2104380
Recommendations
- Solving a class of geometric programming problems by an efficient dynamic model
- Stochastic geometric optimization with joint probabilistic constraints
- A neural network for nonlinear programming with linear constraints
- A dynamical neural network approach for distributionally robust chance-constrained Markov decision process
- Stochastic geometric programming with joint probabilistic constraints
Cites work
- scientific article; zbMATH DE number 53595 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- A deterministic annealing neural network for convex programming
- A dynamic system model for solving convex nonlinear optimization problems
- A second-order cone programming approach for linear programs with joint probabilistic constraints
- An improved geometric programming approach for optimization of biochemical systems
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Copula theory approach to stochastic geometric programming
- Geometric Programming Duals of Channel Capacity and Rate Distortion
- Stochastic geometric optimization with joint probabilistic constraints
- Stochastic geometric programming with an application
- The commutant lifting approach to interpolation problems
- Tractable approximate robust geometric programming
- Variational Analysis
Cited in
(1)
This page was built for publication: A neural network approach to solve geometric programs with joint probabilistic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104380)