التفاصيل البيبلوغرافية
| العنوان: |
Direct search based on probabilistic feasible descent for bound and linearly constrained problems. |
| المؤلفون: |
Gratton, S.1 (AUTHOR) serge.gratton@enseeiht.fr, Royer, C. W.2 (AUTHOR) croyer2@wisc.edu, Vicente, L. N.3 (AUTHOR) lnv@mat.uc.pt, Zhang, Z.4 (AUTHOR) zaikun.zhang@polyu.edu.hk |
| المصدر: |
Computational Optimization & Applications. Apr2019, Vol. 72 Issue 3, p525-559. 35p. |
| مصطلحات موضوعية: |
CONJUGATE gradient methods, SET functions, CONES |
| مستخلص: |
Direct search is a methodology for derivative-free optimization whose iterations are characterized by evaluating the objective function using a set of polling directions. In deterministic direct search applied to smooth objectives, these directions must somehow conform to the geometry of the feasible region, and typically consist of positive generators of approximate tangent cones (which then renders the corresponding methods globally convergent in the linearly constrained case). One knows however from the unconstrained case that randomly generating the polling directions leads to better complexity bounds as well as to gains in numerical efficiency, and it becomes then natural to consider random generation also in the presence of constraints. In this paper, we study a class of direct-search methods based on sufficient decrease for solving smooth linearly constrained problems where the polling directions are randomly generated (in approximate tangent cones). The random polling directions must satisfy probabilistic feasible descent, a concept which reduces to probabilistic descent in the absence of constraints. Such a property is instrumental in establishing almost-sure global convergence and worst-case complexity bounds with overwhelming probability. Numerical results show that the randomization of the polling directions can be beneficial over standard approaches with deterministic guarantees, as it is suggested by the respective worst-case complexity bounds. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Business Source Index |
Full Text Finder