Abstract
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æ. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
