Coralia Cartis

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 37

Top Topics

Global Convergence

Regularization Methods

Nonlinear Optimization

Top Venues

Optim. Methods Softw.

IEEE Trans. Inf. Theory

Publications

Wenqi Zhu, Coralia Cartis
Global Convergence of High-Order Regularization Methods with Sums-of-Squares Taylor Models. CoRR (2024)
Florentin Goyens, Coralia Cartis, Stéphane Chrétien
Registration of algebraic varieties using Riemannian optimization. CoRR (2024)
Coralia Cartis, Estelle M. Massart, Adilet Otemissov
Global optimization using random embeddings. Math. Program. 200 (2) (2023)
Coralia Cartis, Lindon Roberts
Scalable subspace methods for derivative-free nonlinear least-squares optimization. Math. Program. 199 (1) (2023)
Coralia Cartis, Wenqi Zhu
Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods. CoRR (2023)
Wenqi Zhu, Coralia Cartis
Cubic-quartic regularization models for solving polynomial subproblems in third-order tensor methods. CoRR (2023)
Coralia Cartis, Estelle M. Massart, Adilet Otemissov
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings. Math. Program. 198 (1) (2023)
Coralia Cartis, Panayotis Mertikopoulos
Optimization Challenges in Data Science - Special Issue Editorial. EURO J. Comput. Optim. 11 (2023)
Coralia Cartis, Jaroslav M. Fowkes, Zhen Shao
A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares. CoRR (2022)
Florentin Goyens, Coralia Cartis, Armin Eftekhari
Nonlinear matrix recovery using optimization on the Grassmann manifold. CoRR (2021)
Coralia Cartis, Estelle Massart, Adilet Otemissov
Global optimization using random embeddings. CoRR (2021)
Coralia Cartis, Jan Fiala, Zhen Shao
Hashing embeddings of optimal dimension, with applications to linear least squares. CoRR (2021)
Naman Agarwal, Nicolas Boumal, Brian Bullins, Coralia Cartis
Adaptive regularization with cubics on manifolds. Math. Program. 188 (1) (2021)
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Optim. Methods Softw. 35 (2) (2020)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. SIAM J. Optim. 30 (1) (2020)
Coralia Cartis, Tyler Ferguson, Lindon Roberts
Scalable Derivative-Free Optimization for Nonlinear Least-Squares Problems. CoRR (2020)
Coralia Cartis, Jan Fiala, Benjamin Marteau, Lindon Roberts
Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers. ACM Trans. Math. Softw. 45 (3) (2019)
Coralia Cartis, Lindon Roberts
A derivative-free Gauss-Newton method. Math. Program. Comput. 11 (4) (2019)
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy. SIAM J. Optim. 29 (1) (2019)
Jose H. Blanchet, Coralia Cartis, Matt Menickelly, Katya Scheinberg
Convergence Rate Analysis of a Stochastic Trust-Region Method via Supermartingales. INFORMS J. Optim. 1 (2) (2019)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization. J. Complex. 53 (2019)
Wayne Arter, Ana Osojnik, Coralia Cartis, Godwin Madho, Chris Jones, Steven Tobias
Data assimilation approach to analysing systems of ordinary differential equations. ISCAS (2018)
Coralia Cartis, Katya Scheinberg
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169 (2) (2018)
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. CoRR (2018)
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization. Found. Comput. Math. 18 (5) (2018)
Coralia Cartis, Andrew Thompson
Quantitative Recovery Conditions for Tree-Based Compressed Sensing. IEEE Trans. Inf. Theory 63 (3) (2017)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 161 (1-2) (2017)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients. Optim. Methods Softw. 32 (6) (2017)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. CoRR (2017)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization. CoRR (2017)
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$. CoRR (2017)
Coralia Cartis, Yiming Yan
Active-set prediction for interior point methods using controlled perturbations. Comput. Optim. Appl. 63 (3) (2016)
Coralia Cartis, Andrew Thompson
Quantitative recovery conditions for tree-based compressed sensing. CoRR (2016)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods. SIAM J. Numer. Anal. 53 (2) (2015)
Coralia Cartis, Andreas Griewank, Philippe L. Toint, Ya-Xiang Yuan
Obituary for Mike Powell. Optim. Methods Softw. 30 (3) (2015)
Coralia Cartis, Andrew Thompson
A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing. IEEE Trans. Inf. Theory 61 (4) (2015)
Coralia Cartis, Jaroslav M. Fowkes, Nicholas I. M. Gould
Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties. J. Glob. Optim. 61 (3) (2015)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 144 (1-2) (2014)
Coralia Cartis, Andrew Thompson
A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing. CoRR (2013)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization. SIAM J. Optim. 23 (3) (2013)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. Optim. Methods Softw. 28 (3) (2013)
Coralia Cartis, Andrew Thompson
An Exact Tree Projection Algorithm for Wavelets. IEEE Signal Process. Lett. 20 (11) (2013)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. SIAM J. Optim. 22 (1) (2012)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. Optim. Methods Softw. 27 (2) (2012)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28 (1) (2012)
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner
Compressed Sensing: How Sharp Is the Restricted Isometry Property? SIAM Rev. 53 (1) (2011)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. SIAM J. Optim. 21 (4) (2011)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127 (2) (2011)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. 130 (2) (2011)
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner, Andrew Thompson
Phase Transitions for Greedy Sparse Approximation Algorithms CoRR (2010)
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner
Compressed Sensing: How sharp is the Restricted Isometry Property CoRR (2010)
Stefania Bellavia, Coralia Cartis, Nicholas I. M. Gould, Benedetta Morini, Philippe L. Toint
Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares. SIAM J. Numer. Anal. 48 (1) (2010)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. SIAM J. Optim. 20 (6) (2010)
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner
Decay Properties of Restricted Isometry Constants. IEEE Signal Process. Lett. 16 (7) (2009)