.png){kind=icon}
.png){kind=icon}
Return
A derivative-free trust-region algorithm with copula-based models for probability maximization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2021.09.040.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This work presents a derivative-free trust-region algorithm for probability maximization problems. We assume that the probability function is continuously differentiable with Lipschitz continuous gradient, but no derivatives are available. The algorithm explores the particular structure of the probability objective function through models based on copul AE. Under reasonable assumptions, the global convergence of the algorithm is analyzed: we prove that all accumulation points of the sequence generated by the algorithm are stationary. The proposed approach is validated by encouraging numerical results on academic and industrial problems. (c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Nonlinear programming
Probability maximization problem
Stochastic programming
Derivative-free optimization
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W