A smoothing function approach to joint chance-constrained programs (Q467479)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6363607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A smoothing function approach to joint chance-constrained programs |
scientific article; zbMATH DE number 6363607 |
Statements
A smoothing function approach to joint chance-constrained programs (English)
0 references
3 November 2014
0 references
An algorithm for stochastic joint chance-constrained optimization problems is developed using the approximation of probability and constraint functions by a difference of two convex functions. The novelty of the proposed algorithm is in the constructed approximation where the approximats are selected from a class of smoothing functions. The convergence of the approximate solution to a Karusk-Kuhn-Tucker point is proved. Several examples are provided to illustrate the performance of the proposed algorithm.
0 references
stochastic optimization
0 references
joint-constrained programs
0 references
DC optimization
0 references
sequential convex approximation
0 references
0 references
0 references
0.99861324
0 references
0.94509476
0 references
0 references
0.89743185
0 references
0.89097714
0 references
0.8887906
0 references
0.8886372
0 references
0.8855326
0 references
0.88492703
0 references
