Period | 23 Oct 2017 |
---|---|
Held at | Universita La Sapienza di Roma, Italy |
Keywords
- nonlinear optimization
- algorithmic complexity
Documents & Links
Related content
-
Research output
-
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Research output: Contribution to journal › Article › peer-review
-
Complexity of partially separable convexly constrained optimization with non-Lipschitzian singularities
Research output: Contribution to journal › Article › peer-review
-
Second-order optimality and beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization
Research output: Contribution to journal › Article › peer-review
-
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Research output: Working paper
-
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization
Research output: Contribution to journal › Article › peer-review
-
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
-
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
Research output: Contribution to journal › Article › peer-review
-
Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
Research output: Contribution to journal › Article › peer-review
-
Projects
-
Complexity in nonlinear optimization
Project: Research
-
Activities
-
A path and some adventures in the jungle of high-order nonlinear optimization
Activity: Talk or presentation types › Invited talk
-
Adventures in the jungle of high-degree nonlinear optimization
Activity: Talk or presentation types › Invited talk