Complexity in nonlinear optimization

TOINT, Philippe (CoI)
Gould, N. I. M. (CoI)
Cartis, Coralia (CoI)

Namur Institute for Complex Systems

Project: Research

25 Article
6 Working paper
2 Other report
1 Book
More

6 results

Filter

2022
First-Order Objective-Function-Free Optimization Algorithms and Their Complexity
Gratton, S., Jerad, S. & TOINT, P., 7 Mar 2022, Arxiv.
Research output: Working paper

File
55 Downloads (Pure)
2021
Adaptive Regularization Minimization Algorithms with Non-Smooth Norms and Euclidean Curvature
Gratton, S. & TOINT, P., May 2021, Arxiv.
Research output: Working paper

Open Access
File
20 Downloads (Pure)
2020
Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions
Cartis, C., Gould, N. & Toint, P., 30 Jan 2020, Arxiv.
Research output: Working paper

File
25 Downloads (Pure)
2015
Improved worst-case evaluation complexity for potentially rank-deficient nonlinear least-Euclidean-norm problems using higher-order regularized models
Cartis, C., Gould, N. I. M. & Toint, P., 18 Nov 2015, 18 p. (naXys technical report).
Research output: Working paper

File
45 Downloads (Pure)
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Birgin, E., Gardenghi, J., Martinez, J-M., Santos, S. A. & Toint, P., Jun 2015, 2015: Namur center for complex systems, 8 p. (naXys Technical Reports; vol. 05-2015).
Research output: Working paper

File
51 Downloads (Pure)
2013
An example of slow convergence for Newton's method on a function with globally Lipschitz continuous Hessian
Cartis, C., Gould, N. I. M. & Toint, P., 5 May 2013, Namur center for complex systems, 9 p.
Research output: Working paper

File
98 Downloads (Pure)