Consider the number of steps needed by algorithms to locate the minimum of functions defined on the d-cube, where the functions are known to have no local minima except the global minimum. Regard this ...

This paper introduces a new class of quasi-Newton algorithms for unconstrained minimization in which no line search is necessary and the inverse Hessian approximations are positive definite. These ...

When Michael Bowling plays poker he does neither — instead he simply looks for a counterfactual regret minimisation algorithm that finds Nash equilibria. Professor Bowling has “solved” poker.

Consequently, algorithms which can be effectively applied in such scenarios are scarce. We introduce and study three stochastic variance-reduced majorization-minimization (MM) algorithms, combining ...