ALGOPT2024 workshop on Algorithmic Optimization

Related content

• Research output

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

  Research output: Working paper › Preprint

• Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints

  Research output: Working paper

• Divergence of the ADAM algorithm with fixed-stepsize: a (very) simple example

  Research output: Working paper › Discussion paper

• A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity

  Research output: Working paper

• Convergence properties of an Objective-Function-Free Optimization regularization algorithm, including an 0(epsilon^{-3/2}) complexity bound

  Research output: Contribution to journal › Article › peer-review

• OFFO minimization algorithms for second-order optimality and their complexity

  Research output: Contribution to journal › Article › peer-review

• Yet another fast variant of Newton's method for nonconvex optimization

  Research output: Working paper

• Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training

  Research output: Contribution to journal › Article › peer-review

• Projects

• ADALGOPT - Advanced algorithms in nonlinear optimization

  Project: Research Axis