- 11 results
Search results
-
2022
Evaluation complexity of algorithms for nonconvex optimization
Cartis, C., Gould, N. I. M. & TOINT, P., Jul 2022, SIAM. 600 p. (SIAM-MOS Series on Optimization)Research output: Book/Report/Journal › Book
-
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 AccessFile58 Downloads (Pure) -
2020
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 AccessFile84 Downloads (Pure) -
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
File75 Downloads (Pure) -
2019
Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
Cartis, C., Gould, N. I. M. & Toint, P., Jun 2019, Springer Optimization and Its Applications: Algorithms, Complexity and Applications. Demetriou, I. & Pardalos, P. (eds.). Springer Heidelberg, p. 5-26 22 p. (Springer Optimization and Its Applications; vol. 145).Research output: Contribution in Book/Catalog/Report/Conference proceeding › Chapter
Open Access -
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization
Cartis, C., Gould, N. I. M. & Toint, P., 10 Aug 2019, In: Journal of Complexity. 53, p. 68-94 27 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile63 Downloads (Pure) -
2017
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Birgin, E. G., Gardenghi, J. L., Martínez, J. M., Santos, S. A. & Toint, P. L., 15 Apr 2017, In: Mathematical Programming. 163, 1-2, p. 359-368 10 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
Toint, P., 2 Nov 2017, In: Optimization Methods and Software. 32, 6, p. 1273-1298 26 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile51 Downloads (Pure) -
2016
Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
Birgin, E., Gardenghi, J., Martinez, J.-M., Santos, S. & Toint, P., 2016, In: SIAM Journal on Optimization. 26, 2, 20 p.Research output: Contribution to journal › Article › peer-review
File68 Downloads (Pure) -
2015
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
File107 Downloads (Pure) -
2014
On the complexity of finding first-order critical points in constrained nonlinear optimization
Cartis, C., Gould, N. I. M. & Toint, P. L., 2014, In: Mathematical Programming. 144, 1-2, p. 93-106 14 p.Research output: Contribution to journal › Article › peer-review
File120 Downloads (Pure)