English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Evolution strategy (ES) is one of the promising classes of algorithms for black-box continuous optimization. Despite its broad successes in applications, theoretical analysis on the speed of its convergence is limited on convex quadratic functions and their monotonic transformation. In this study, an upper bound and a lower bound of the rate of linear convergence of the (1+1)-ES on locally L-strongly convex functions with U-Lipschitz continuous gradient are derived as exp(-&#x03A9;d&#x221E;(Ld&#x2219;U)) and exp(-1d), respectively. Notably, any prior knowledge on the mathematical properties of the objective function, such as Lipschitz constant, is not given to the algorithm, whereas the existing analyses of derivative-free optimization algorithms require it.

Convergence Rate of the (1+1)-ES on Locally Strongly Convex and Lipschitz Smooth Functions