3 citations · 8 across the 3 of their papers we have counts for
3 papers
math.OC2020★ 3 cited
Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions
Coralia Cartis, Nick Gould, Philippe L. Toint
We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and…
math.OC2019★ 2 cited
High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms
X. Chen, Ph. L. Toint
This paper studies high-order evaluation complexity for partially separable convexly-constrained optimization involving non-Lipschitzian group sparsity terms in a nonconvex objecti…
math.OC2019★ 3 cited
Minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
S. Gratton, E. Simon, Ph. L. Toint
An adaptive regularization algorithm using inexact function and derivatives evaluations is proposed for the solution of composite nonsmooth nonconvex optimization. It is shown that…