Research output per year
Research output per year
- 22 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
-
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 AccessFile48 Downloads (Pure) -
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 AccessFile35 Downloads (Pure) -
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
-
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 32 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile38 Downloads (Pure) -
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
-
2017
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 AccessFile24 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
File40 Downloads (Pure) -
Simple examples for the failure of Newton’s method with line search for strictly convex minimization
Jarre, F. & Toint, P. L., Jun 2016, In: Mathematical Programming. 158, 1, p. 23-34Research output: Contribution to journal › Article › peer-review
-
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
File60 Downloads (Pure) -
On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods
Cartis, C., Gould, N. I. M. & Toint, P. L., 2015, In: SIAM Journal on Numerical Analysis. 53, 2, p. 836-851 16 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile169 Downloads (Pure) -
Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
Cartis, C., Rodrigues Sampaio, P. & Toint, P. L., 4 May 2015, In: Optimization. 64, 5, p. 1349-1361 13 p.Research output: Contribution to journal › Article › peer-review
File133 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
File62 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
File111 Downloads (Pure) -
A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
Cartis, C., Gould, N. I. M. & Toint, P. L., 1 Jun 2013, In: Optimization Methods and Software. 28, 3, p. 451-457 7 p.Research output: Contribution to journal › Article › peer-review
File33 Downloads (Pure) -
On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
Cartis, C., Gould, N. & Toint, P., 29 Oct 2013, In: SIAM Journal on Optimization. 23, 3, p. 1553-1574 22 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile164 Downloads (Pure) -
2012
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
Cartis, C., Gould, N. & Toint, P., 1 Oct 2012, In: IMA Journal of Numerical Analysis. 32, 4, p. 1662-1695 34 p.Research output: Contribution to journal › Article › peer-review
File130 Downloads (Pure) -
Complexity bounds for second-order optimality in unconstrained optimization
Cartis, C., Gould, N. I. M. & Toint, P., 1 Feb 2012, In: Journal of Complexity. 28, p. 93-108 16 p.Research output: Contribution to journal › Article › peer-review
File44 Downloads (Pure) -
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
Toint, P., Cartis, C. & Gould, N., 1 Apr 2012, In: Optimization Methods and Software. 27, 2, p. 197-219 23 p.Research output: Contribution to journal › Article › peer-review
File185 Downloads (Pure) -
On the complexity of the steepest-descent with exact linesearches
Cartis, C., Gould, N. I. M. & Toint, P., 2012, FUNDP. Namur center for complex systems. (NAXYS Technical Report; vol. 16-2012)Research output: Book/Report/Journal › Other report
Open AccessFile75 Downloads (Pure) -
On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
Cartis, C., Gould, N. I. M. & Toint, P., 1 Jan 2012, In: SIAM Journal on Optimization. 22, 1, p. 66-86 21 p.Research output: Contribution to journal › Article › peer-review
File54 Downloads (Pure) -
2011
Adaptive cubic regularisation methods for unconstrained optimization. Part II: Worst-case function- and derivative-evaluation complexity
Cartis, C., Gould, N. & Toint, P., 1 Dec 2011, In: Mathematical Programming. 130, 2, p. 295-319 25 p.Research output: Contribution to journal › Article › peer-review
File182 Downloads (Pure)