Description
Invited webinar at the Polytechnic University of Hong Kong [AMA]| Period | 8 May 2020 |
|---|---|
| Held at | Polytechnic University of Hong Kong, Hong Kong |
| Degree of Recognition | Regional |
Keywords
- evaluation complexity
- nonlinear optimization
Documents & Links
Related content
-
Activities
-
Departement of Applied Mathematics, Polytechnic University of Hong Kong
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 results in worst-case evaluation complexity for smooth and non-smooth, exact and inexact, nonconvex optimization
Activity: Talk or presentation types › Invited talk
-
Research output
-
A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
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
-
High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms
Research output: Contribution to journal › Article › peer-review
-
Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions
Research output: Working paper
-
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
Research output: Contribution to journal › Article › peer-review
-
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
Research output: Contribution to journal › Article › peer-review