| Period | 4 Oct 2019 |
|---|---|
| Held at | Department of Mathematics and Computer Science, University of Florence, Italy |
| Degree of Recognition | Regional |
Keywords
- optimization
- complexity theory
Documents & Links
Related content
-
Research output
-
Complexity of partially separable convexly constrained optimization with non-Lipschitzian singularities
Research output: Contribution to journal › Article › peer-review
-
Adaptive regularization algorithms with inexact evaluations for nonconvex optimization
Research output: Contribution to journal › Article › peer-review
-
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization
Research output: Contribution to journal › Article › peer-review
-
Activities
-
DIEF, University of Florence
Activity: Visiting an external institution types › Visiting an external academic institution
-
DIEF, University of Florence
Activity: Visiting an external institution types › Visiting an external academic institution
-
Recent topics in complexity for nonconvex optimization problems
Activity: Talk or presentation types › Invited talk
-
University of Oxford
Activity: Visiting an external institution types › Visiting an external academic institution
-
DIEF, University of Florence
Activity: Visiting an external institution types › Visiting an external academic institution
-
DIEF, University of Florence
Activity: Visiting an external institution types › Visiting an external academic institution
-
DIEF, University of Florence
Activity: Visiting an external institution types › Visiting an external academic institution