Coralia Cartis

64 papers C 1Journal 63

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems. CoRR Yubo Cai, Wenqi Zhu, Coralia Cartis, Gioele Zardini
2026	J	`jnl`	Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods. Math. Program. Coralia Cartis, Wenqi Zhu
2025	J	`jnl`	Global Optimality Characterizations and Algorithms for Minimizing Quartically-Regularized Third-Order Taylor Polynomials. CoRR Wenqi Zhu, Coralia Cartis
2025	J	`jnl`	Nonlinear Dimensionality Reduction Techniques for Bayesian Optimization. CoRR Luo Long, Coralia Cartis, Paz Fink Shustin
2025	J	`jnl`	On Global Rates for Regularization Methods based on Secant Derivative Approximations. CoRR Coralia Cartis, Sadok Jerad
2025	J	`jnl`	On the Neural Feature Ansatz for Deep Neural Networks. CoRR Edward Tansley, Estelle M. Massart, Coralia Cartis
2025	J	`jnl`	Random Subspace Cubic-Regularization Methods, with Applications to Low-Rank Functions. CoRR Coralia Cartis, Zhen Shao, Edward Tansley
2025	J	`jnl`	SoS1: O1 and R1-Like Reasoning LLMs are Sum-of-Square Solvers. CoRR Kechen Li, Wenqi Zhu, Coralia Cartis, Tianbo Ji, Shiwei Liu
2025	J	`jnl`	Tensor-based Dinkelbach method for computing generalized tensor eigenvalues and its applications. CoRR Haibin Chen, Wenqi Zhu, Coralia Cartis
2024	J	`jnl`	Dimensionality Reduction Techniques for Global Bayesian Optimisation. CoRR Luo Long, Coralia Cartis, Paz Fink Shustin
2024	J	`jnl`	Global Convergence of High-Order Regularization Methods with Sums-of-Squares Taylor Models. CoRR Wenqi Zhu, Coralia Cartis
2024	J	`jnl`	Registration of algebraic varieties using Riemannian optimization. CoRR Florentin Goyens, Coralia Cartis, Stéphane Chrétien
2023	J	`jnl`	Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings. Math. Program. Coralia Cartis, Estelle M. Massart, Adilet Otemissov
2023	J	`jnl`	Cubic-quartic regularization models for solving polynomial subproblems in third-order tensor methods. CoRR Wenqi Zhu, Coralia Cartis
2023	J	`jnl`	Global optimization using random embeddings. Math. Program. Coralia Cartis, Estelle M. Massart, Adilet Otemissov
2023	J	`jnl`	Optimization Challenges in Data Science - Special Issue Editorial. EURO J. Comput. Optim. Coralia Cartis, Panayotis Mertikopoulos
2023	J	`jnl`	Scalable subspace methods for derivative-free nonlinear least-squares optimization. Math. Program. Coralia Cartis, Lindon Roberts
2023	J	`jnl`	Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods. CoRR Coralia Cartis, Wenqi Zhu
2022	J	`jnl`	A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares. CoRR Coralia Cartis, Jaroslav M. Fowkes, Zhen Shao
2021	J	`jnl`	Adaptive regularization with cubics on manifolds. Math. Program. Naman Agarwal, Nicolas Boumal, Brian Bullins, Coralia Cartis
2021	J	`jnl`	Global optimization using random embeddings. CoRR Coralia Cartis, Estelle M. Massart, Adilet Otemissov
2021	J	`jnl`	Hashing embeddings of optimal dimension, with applications to linear least squares. CoRR Coralia Cartis, Jan Fiala, Zhen Shao
2021	J	`jnl`	Nonlinear matrix recovery using optimization on the Grassmann manifold. CoRR Florentin Goyens, Coralia Cartis, Armin Eftekhari
2020	J	`jnl`	A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Optim. Methods Softw. Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
2020	J	`jnl`	Scalable Derivative-Free Optimization for Nonlinear Least-Squares Problems. CoRR Coralia Cartis, Tyler Ferguson, Lindon Roberts
2020	J	`jnl`	Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2019	J	`jnl`	A derivative-free Gauss-Newton method. Math. Program. Comput. Coralia Cartis, Lindon Roberts
2019	J	`jnl`	Convergence Rate Analysis of a Stochastic Trust-Region Method via Supermartingales. INFORMS J. Optim. Jose H. Blanchet, Coralia Cartis, Matt Menickelly, Katya Scheinberg
2019	J	`jnl`	Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers. ACM Trans. Math. Softw. Coralia Cartis, Jan Fiala, Benjamin Marteau, Lindon Roberts
2019	J	`jnl`	Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization. J. Complex. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2019	J	`jnl`	Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy. SIAM J. Optim. Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
2018	C	`conf`	Data assimilation approach to analysing systems of ordinary differential equations. ISCAS Wayne Arter, Ana Osojnik, Coralia Cartis, Godwin Madho, Chris A. Jones, Steven Tobias
2018	J	`jnl`	Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. Coralia Cartis, Katya Scheinberg
2018	J	`jnl`	Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization. Found. Comput. Math. Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
2018	J	`jnl`	Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. CoRR Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$. CoRR Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. CoRR Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization. CoRR Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Quantitative Recovery Conditions for Tree-Based Compressed Sensing. IEEE Trans. Inf. Theory Coralia Cartis, Andrew Thompson
2017	J	`jnl`	Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients. Optim. Methods Softw. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2016	J	`jnl`	Active-set prediction for interior point methods using controlled perturbations. Comput. Optim. Appl. Coralia Cartis, Yiming Yan
2016	J	`jnl`	Quantitative recovery conditions for tree-based compressed sensing. CoRR Coralia Cartis, Andrew Thompson
2015	J	`jnl`	A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing. IEEE Trans. Inf. Theory Coralia Cartis, Andrew Thompson
2015	J	`jnl`	Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties. J. Glob. Optim. Coralia Cartis, Jaroslav M. Fowkes, Nicholas I. M. Gould
2015	J	`jnl`	Obituary for Mike Powell. Optim. Methods Softw. Coralia Cartis, Andreas Griewank, Philippe L. Toint, Ya-Xiang Yuan
2015	J	`jnl`	On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods. SIAM J. Numer. Anal. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2014	J	`jnl`	On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2013	J	`jnl`	A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing. CoRR Coralia Cartis, Andrew Thompson
2013	J	`jnl`	A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. Optim. Methods Softw. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2013	J	`jnl`	An Exact Tree Projection Algorithm for Wavelets. IEEE Signal Process. Lett. Coralia Cartis, Andrew Thompson
2013	J	`jnl`	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. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2012	J	`jnl`	Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2012	J	`jnl`	Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. Optim. Methods Softw. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2012	J	`jnl`	On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2011	J	`jnl`	Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2011	J	`jnl`	Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2011	J	`jnl`	Compressed Sensing: How Sharp Is the Restricted Isometry Property? SIAM Rev. Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner
2011	J	`jnl`	On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2010	J	`jnl`	Compressed Sensing: How sharp is the Restricted Isometry Property CoRR Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner
2010	J	`jnl`	Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares. SIAM J. Numer. Anal. Stefania Bellavia, Coralia Cartis, Nicholas I. M. Gould, Benedetta Morini, Philippe L. Toint
2010	J	`jnl`	On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2010	J	`jnl`	Phase Transitions for Greedy Sparse Approximation Algorithms CoRR Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner, Andrew Thompson
2009	J	`jnl`	Decay Properties of Restricted Isometry Constants. IEEE Signal Process. Lett. Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner