Description
Research Visit to the University of OxfordResearch Visit to discuss th theory of complexity for first-order methods applied on functions with hölder continuous gradients
Period | 1 Sept 2014 → 2 Sept 2014 |
---|---|
Visiting | University of Oxford |
Related content
-
Research output
-
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
-
An example of slow convergence for Newton's method on a function with globally Lipschitz continuous Hessian
Research output: Working paper
-
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
-
ADALGOPT - Advanced algorithms in nonlinear optimization
Project: Research Axis
-
Complexity in nonlinear optimization
Project: Research