Leverhulme Fellow

Related content

• Research output

• Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models

  Research output: Contribution in Book/Catalog/Report/Conference proceeding › Chapter

• Improved worst-case evaluation complexity for potentially rank-deficient nonlinear least-Euclidean-norm problems using higher-order regularized models

  Research output: Working paper

• Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization

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

• On the complexity of finding first-order critical points in constrained nonlinear optimization

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

• On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods

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

• On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization

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

• A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function

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

• Projects

• Complexity in nonlinear optimization

  Project: Research