An optimally fast objective-function-free minimization algorithm using random subspaces

S. Bellavia, S. Gratton, B. Morini +1

An algorithm for unconstrained non-convex optimization is described, which does not evaluate the objective function and in which minimization is carried out, at each iteration, wit…