.png){kind=icon}
返回
Derivative-free optimization methods
.png){kind=icon}
OA
AI
DOI：10.1017/S0962492919000060.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In many optimization problems arising from scientific, engineering and artificial intelligence applications, objective and constraint functions are available only as the output of a black-box or simulation oracle that does not provide derivative information. Such settings necessitate the use of methods for derivative-free, or zeroth-order, optimization. We provide a review and perspectives on developments in these methods, with an emphasis on high-lighting recent developments and on unifying treatment of such problems in the non-linear optimization and machine learning literature. We categorize methods based on assumed properties of the black-box functions, as well as features of the methods. We first overview the primary setting of deterministic methods applied to unconstrained, non-convex optimization problems where the objective function is defined by a deterministic black-box oracle. We then discuss developments in randomized methods, methods that assume some additional structure about the objective (including convexity, separability and general non-smooth compositions), methods for problems where the output of the black-box oracle is stochastic, and methods for handling different types of constraints.
Keyword:
ADAPTIVE DIRECT SEARCH
TRUST-REGION METHODS
WORST-CASE COMPLEXITY
NELDER-MEAD ALGORITHM
EFFICIENT GLOBAL OPTIMIZATION
PARTIALLY SEPARABLE FUNCTIONS
IMPLICIT FILTERING ALGORITHM
BASIS FUNCTION INTERPOLATION
PARALLEL PATTERN SEARCH
MODEL-BASED ALGORITHMS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.3
论文数:
89
被引数:
3.4K
机构
引用论文
.png){kind=icon}
分享收藏Adapt or Perish ! A Systematic Review of the Literature on Strategic Renewal and the Family Firm
OAAI
OAAI分享收藏
查看更多内容