.png){kind=icon}
Return
Augmented Lagrangian method for probabilistic optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-011-0884-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We analyze nonlinear stochastic optimization problems with probabilistic constraints described by continuously differentiable non-convex functions. We describe the tangent and the normal cone to the level sets of the underlying probability function and provide new insight into their structure. Furthermore, we formulate fist order and second order conditions of optimality for these problems based on the notion of p-efficient points. We develop an augmented Lagrangian method for the case of discrete distribution functions. The method is based on progressive inner approximation of the level set of the probability function by generation of p-efficient points. Numerical experience is provided.
Keywords:
Stochastic programming
Probabilistic constraints
Chance constraints
Second-order optimality conditions
p-efficient points
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more