Decay Properties of Restricted Isometry Constants. - Jeffrey D. Blanchard; Coralia Cartis; Jared Tanner (IEEE Signal Process. Lett., 2009)

Phase Transitions for Greedy Sparse Approximation Algorithms - Jeffrey D. Blanchard; Coralia Cartis; Jared Tanner; Andrew Thompson 001 (CoRR, 2010)

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2010)

Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares. - Stefania Bellavia; Coralia Cartis; Nicholas I. M. Gould; Benedetta Morini; Philippe L. Toint (SIAM J. Numer. Anal., 2010)

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 2011)

Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 2011)

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2011)

Compressed Sensing: How Sharp Is the Restricted Isometry Property? - Jeffrey D. Blanchard; Coralia Cartis; Jared Tanner (SIAM Rev., 2011)

Complexity bounds for second-order optimality in unconstrained optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (J. Complex., 2012)

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Optim. Methods Softw., 2012)

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2012)

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Optim. Methods Softw., 2013)

On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2013)

An Exact Tree Projection Algorithm for Wavelets. - Coralia Cartis; Andrew Thompson 001 (IEEE Signal Process. Lett., 2013)

On the complexity of finding first-order critical points in constrained nonlinear optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 2014)

Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties. - Coralia Cartis; Jaroslav M. Fowkes; Nicholas I. M. Gould (J. Glob. Optim., 2015)

Obituary for Mike Powell. - Coralia Cartis; Andreas Griewank; Philippe L. Toint; Ya-Xiang Yuan (Optim. Methods Softw., 2015)

On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Numer. Anal., 2015)

A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing. - Coralia Cartis; Andrew Thompson 001 (IEEE Trans. Inf. Theory, 2015)

Active-set prediction for interior point methods using controlled perturbations. - Coralia Cartis; Yiming Yan (Comput. Optim. Appl., 2016)

Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$. - Coralia Cartis; Nick I. M. Gould; Philippe L. Toint (CoRR, 2017)

Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (CoRR, 2017)

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 2017)

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Optim. Methods Softw., 2017)

Quantitative Recovery Conditions for Tree-Based Compressed Sensing. - Coralia Cartis; Andrew Thompson 001 (IEEE Trans. Inf. Theory, 2017)

Data assimilation approach to analysing systems of ordinary differential equations. - Wayne Arter; Ana Osojnik; Coralia Cartis; Godwin Madho; Chris A. Jones; Steven Tobias (ISCAS, 2018)

Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization. - Coralia Cartis; Nick I. M. Gould; Philippe L. Toint (Found. Comput. Math., 2018)

Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. - Coralia Cartis; Katya Scheinberg (Math. Program., 2018)

Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (J. Complex., 2019)

A derivative-free Gauss-Newton method. - Coralia Cartis; Lindon Roberts (Math. Program. Comput., 2019)

Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy. - Coralia Cartis; Nick I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2019)

Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers. - Coralia Cartis; Jan Fiala; Benjamin Marteau; Lindon Roberts (ACM Trans. Math. Softw., 2019)

Convergence Rate Analysis of a Stochastic Trust-Region Method via Supermartingales. - Jose H. Blanchet; Coralia Cartis; Matt Menickelly; Katya Scheinberg (INFORMS J. Optim., 2019)

Scalable Derivative-Free Optimization for Nonlinear Least-Squares Problems. - Coralia Cartis; Tyler Ferguson; Lindon Roberts (CoRR, 2020)

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. - Coralia Cartis; Nick I. M. Gould; Philippe L. Toint (Optim. Methods Softw., 2020)

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2020)

Hashing embeddings of optimal dimension, with applications to linear least squares. - Coralia Cartis; Jan Fiala; Zhen Shao (CoRR, 2021)

Nonlinear matrix recovery using optimization on the Grassmann manifold. - Florentin Goyens; Coralia Cartis; Armin Eftekhari (CoRR, 2021)

Adaptive regularization with cubics on manifolds. - Naman Agarwal; Nicolas Boumal; Brian Bullins; Coralia Cartis (Math. Program., 2021)

A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares. - Coralia Cartis; Jaroslav M. Fowkes; Zhen Shao (CoRR, 2022)

Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods. - Coralia Cartis; Wenqi Zhu (CoRR, 2023)

Cubic-quartic regularization models for solving polynomial subproblems in third-order tensor methods. - Wenqi Zhu; Coralia Cartis (CoRR, 2023)

Optimization Challenges in Data Science - Special Issue Editorial. - Coralia Cartis; Panayotis Mertikopoulos (EURO J. Comput. Optim., 2023)

Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings. - Coralia Cartis; Estelle M. Massart; Adilet Otemissov (Math. Program., 2023)

Scalable subspace methods for derivative-free nonlinear least-squares optimization. - Coralia Cartis; Lindon Roberts (Math. Program., 2023)

Global optimization using random embeddings. - Coralia Cartis; Estelle M. Massart; Adilet Otemissov (Math. Program., 2023)

Registration of algebraic varieties using Riemannian optimization. - Florentin Goyens; Coralia Cartis; Stéphane Chrétien (CoRR, 2024)

Global Convergence of High-Order Regularization Methods with Sums-of-Squares Taylor Models. - Wenqi Zhu; Coralia Cartis (CoRR, 2024)

Dimensionality Reduction Techniques for Global Bayesian Optimisation. - Luo Long; Coralia Cartis; Paz Fink Shustin (CoRR, 2024)

Random Subspace Cubic-Regularization Methods, with Applications to Low-Rank Functions. - Coralia Cartis; Zhen Shao; Edward Tansley (CoRR, 2025)

Tensor-based Dinkelbach method for computing generalized tensor eigenvalues and its applications. - Haibin Chen; Wenqi Zhu; Coralia Cartis (CoRR, 2025)

SoS1: O1 and R1-Like Reasoning LLMs are Sum-of-Square Solvers. - Kechen Li; Wenqi Zhu; Coralia Cartis; Tianbo Ji; Shiwei Liu 003 (CoRR, 2025)

Global Optimality Characterizations and Algorithms for Minimizing Quartically-Regularized Third-Order Taylor Polynomials. - Wenqi Zhu; Coralia Cartis (CoRR, 2025)