Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions

Coralia Cartis, Nick Gould, Philippe Toint

Namur Institute for Complex Systems

Research output: Working paper

29 Downloads (Pure)

8 Article
1 Book
1 Paper

8 results

Filter

2018
Second-order optimality and beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization
Cartis, C., Gould, N. I. M. & Toint, P., 1 Oct 2018, In: Foundations of Computational Mathematics. 18, 5, p. 1073-1107 35 p.
Research output: Contribution to journal › Article › peer-review
2019
Complexity of partially separable convexly constrained optimization with non-Lipschitzian singularities
Chen, X., Toint, P. & Wang, H., 15 Apr 2019, In: SIAM Journal on Optimization. 29, 1, p. 874-903 30 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
44 Downloads (Pure)
Universal regularization methods: varying the power, the smoothness and the accuracy
Cartis, C., Gould, N. I. & Toint, P. L., 1 Jan 2019, In: SIAM Journal on Optimization. 29, 1, p. 595-615 21 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
16 Downloads (Pure)
2020
A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
Cartis, C., Gould, N. I. M. & Toint, P. L., 3 Mar 2020, In: Optimization Methods and Software. 35, 2, p. 243-256 14 p.
Research output: Contribution to journal › Article › peer-review
Adaptive regularization algorithms with inexact evaluations for nonconvex optimization
Bellavia, S., Gurioli, G., Morini, B. & Toint, P., 2 Jan 2020, In: SIAM Journal on Optimization. 29, 4, p. 2881-2915 35 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
37 Downloads (Pure)
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
Gratton, S., Simon, E. & Toint, P., 21 Jan 2020, In: Mathematical Programming. 187, 1-2, p. 1-24 19 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
56 Downloads (Pure)
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
Toint, P., Cartis, C. & Gould, N. I. M., Jan 2020, In: SIAM Journal on Optimization. 30, 1, p. 513-541 29 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
49 Downloads (Pure)
2021
High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms
Chen, X. & Toint, P., May 2021, In: Mathematical Programming. 187, 1-2, p. 47-78 32 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
39 Downloads (Pure)

Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions

Research output

Search results