arXiv Analytics

Sign in

arXiv:1102.1347 [math.OC]AbstractReferencesReviewsResources

Universal derivative-free optimization method with quadratic convergence

Sergey Moiseev

Published 2011-02-07Version 1

A new universal derivative-free optimization method CDOS (Conjugate Direction with Orthogonal Shift) is proposed. The CDOS method was specially developed to solve optimization tasks where the objective function and constraints are black boxes. The method has quadratic convergence for quadratic and near quadratic functions. An objective function can be non-differentiable and non-continuous. For constrained optimization the constraints can also be non-differentiable and non-continuous. The method handles inequality constraints directly, i.e., it does not transform the objective function, nor uses numeric values of the inequality constraints - it uses only the fact of constraint violation.

Related articles: Most relevant | Search more
arXiv:2104.14750 [math.OC] (Published 2021-04-30)
A Refined Inertial DCA for DC Programming
arXiv:1802.01062 [math.OC] (Published 2018-02-04)
How to Characterize the Worst-Case Performance of Algorithms for Nonconvex Optimization
arXiv:1903.11366 [math.OC] (Published 2019-03-27)
A Method for Convex Black-Box Integer Global Optimization