Coralia Cartis
#66,003
Most Influential Person Now
Romanian mathematician
Coralia Cartis's AcademicInfluence.com Rankings
Coralia Cartismathematics Degrees
Mathematics
#4170
World Rank
#5979
Historical Rank
Measure Theory
#3543
World Rank
#4183
Historical Rank
Download Badge
Mathematics
Coralia Cartis's Degrees
- PhD Mathematics University of Bucharest
Why Is Coralia Cartis Influential?
(Suggest an Edit or Addition)According to Wikipedia, Coralia Cartis is a Romanian mathematician at the University of Oxford whose research interests include compressed sensing, numerical analysis, and regularisation methods in mathematical optimization. At Oxford, she is a Professor in Numerical Optimization in the Mathematical Institute, and a tutorial fellow of Balliol College.
Coralia Cartis's Published Works
Published Works
- Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results (2011) (336)
- Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity (2011) (296)
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems (2010) (234)
- Erratum to: ``Global rates of convergence for nonconvex optimization on manifolds'' (2016) (222)
- Compressed Sensing: How Sharp Is the Restricted Isometry Property? (2010) (166)
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models (2015) (118)
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming (2011) (102)
- Complexity bounds for second-order optimality in unconstrained optimization (2012) (99)
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers (2018) (87)
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity (2012) (85)
- Convergence Rate Analysis of a Stochastic Trust-Region Method via Supermartingales (2016) (79)
- Phase Transitions for Greedy Sparse Approximation Algorithms (2010) (65)
- Adaptive cubic overestimation methods for unconstrained optimization (2007) (63)
- On the complexity of finding first-order critical points in constrained nonlinear optimization (2014) (58)
- On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (2012) (56)
- On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization (2013) (52)
- Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares (2010) (48)
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy (2018) (45)
- A derivative-free Gauss–Newton method (2017) (43)
- Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization (2018) (42)
- A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing (2013) (40)
- Convergence Rate Analysis of a Stochastic Trust Region Method for Nonconvex Optimization (2016) (40)
- WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION (2017) (38)
- Trust-region and other regularisations of linear least-squares problems (2009) (37)
- Adaptive regularization with cubics on manifolds (2018) (35)
- Adaptive cubic overestimation methods for unconstrained optimization. Part I: motivation, convergence and numerical results (2008) (35)
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization (2012) (35)
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (2009) (31)
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods (2015) (30)
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints (2018) (28)
- Can Top-of-Atmosphere Radiation Measurements Constrain Climate Predictions? Part II: Climate Sensitivity (2013) (27)
- Finding a point in the relative interior of a polyhedron (2007) (26)
- Decay Properties of Restricted Isometry Constants (2009) (25)
- Optimal Newton-type methods for nonconvex smooth optimization problems (2011) (25)
- Escaping local minima with derivative-free methods: a numerical investigation (2018) (23)
- Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (2017) (23)
- Can Top-of-Atmosphere Radiation Measurements Constrain Climate Predictions? Part I: Tuning (2013) (22)
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization (2015) (22)
- An Exact Tree Projection Algorithm for Wavelets (2013) (21)
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (2017) (18)
- Calibrating climate models using inverse methods: case studies with HadAM3, HadAM3P and HadCM3 (2017) (17)
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (2015) (17)
- Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients (2017) (16)
- Scalable subspace methods for derivative-free nonlinear least-squares optimization (2021) (16)
- THE RESTRICTED ISOMETRY PROPERTY AND ` Q-REGULARIZATION : PHASE TRANSITIONS FOR SPARSE APPROXIMATION (2009) (15)
- Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization (2017) (12)
- Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization Using Scaled KKT Conditions and High-Order Models (2019) (12)
- How much patience do you have? A worst-case perspective on smooth nonconvex optimization (2012) (11)
- COMPRESSED SENSING : HOW SHARP IS THE RIP ? (2009) (11)
- Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions (2020) (11)
- A dimensionality reduction technique for unconstrained global optimization of functions with low effective dimensionality (2020) (11)
- A concise second-order complexity analysis for unconstrained optimization using high-order regularized models (2019) (10)
- On the Convergence of a Primal-Dual Second-0rder Corrector Interior Point Algorithm for Linear Programming (2005) (10)
- Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$ (2017) (10)
- Phase Transitions for Restricted Isometry Properties (2009) (9)
- Improved worst-case evaluation complexity for potentially rank-deficient nonlinear least-Euclidean-norm problems using higher-order regularized models (2015) (8)
- A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function (2013) (7)
- Escaping local minima with local derivative-free methods: a numerical investigation (2021) (7)
- Adaptive regularization with cubics on manifolds with a first-order analysis (2018) (7)
- Active-set prediction for interior point methods using controlled perturbations (2014) (6)
- Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives (2022) (6)
- Hashing embeddings of optimal dimension, with applications to linear least squares (2021) (6)
- Strong Evaluation Complexity of An Inexact Trust-Region Algorithm for Arbitrary-Order Unconstrained Nonconvex Optimization. (2020) (5)
- Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings (2020) (5)
- On the complexity of finding first-order critical points in constrained nonlinear optimization (2012) (4)
- Randomised subspace methods for non-convex optimization, with applications to nonlinear least-squares (2022) (4)
- Second-order optimality and beyond: characterization and evaluation complexity in nonconvex convexly-constrained optimization (2016) (4)
- A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares (2022) (4)
- On the complexity of the steepest-descent with exact linesearches (2012) (3)
- Adaptive cubic overestimation methods for unconstrained optimization . Part II : worst-case iteration complexity (2007) (3)
- Quantitative Recovery Conditions for Tree-Based Compressed Sensing (2016) (3)
- Data assimilation approach to analysing systems of ordinary differential equations (2018) (3)
- Scalable Derivative-Free Optimization for Nonlinear Least-Squares Problems (2020) (3)
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models (2017) (3)
- Global optimization using random embeddings (2021) (2)
- A concise second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (2019) (2)
- A derivative-free optimisation method for global ocean biogeochemical models (2021) (2)
- Nonlinear matrix recovery using optimization on the Grassmann manifold (2021) (1)
- A derivative-free Gauss–Newton method (2019) (1)
- Convergent least-squares optimisation methods for variational data assimilation (2021) (1)
- An example of slow convergence for Newton's method on a function with globally Lipschitz continuous Hessian (2013) (1)
- On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces (2019) (1)
- Some Disadvantages of a Mehrotra-Type Primal-DualCorre tor Interior Point Algorithm for LinearProgrammingCoralia Cartis (2011) (0)
- Obituary for Mike Powell (2015) (0)
- Tuning The Sea-Ice Seasonal Cycle Of HadCM3: Can It Reproduce Observed Trends In Sea-Ice? (2015) (0)
- CNV Convex and Nonsmooth Optimization DER Derivative-free and Simulation-based Optimization GLO Global Optimization MUL Multi-Objective and Vector Optimization NON Nonlinear Optimization PLA Optimization Applications in Mathematics of Planet Earth IMP Optimization Implementations and Software PDE PD (2019) (0)
- Some New Results Concerning the Primal-Dual Path-Following Interior Point Algorithm for Linear Programming (2005) (0)
- RAL-TR-2007-007 Adaptive cubic overestimation methods for unconstrained optimization (0)
- Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization (2017) (0)
- Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization (2016) (0)
- A new perspective on the complexity of interior point methods for linear programming (2007) (0)
- Estimating climate sensitivity from an ensemble of GCM configurations optimized to outgoing TOA radiation (2014) (0)
- Overview on parallel sessions / tentative schedule Version from 2019-0711 Cluster Shortcuts (2019) (0)
- Constraining Climate Sensitivity using Top Of Atmosphere Radiation Measurements (2012) (0)
- RAL-TR-2008-005 Trust-region and other regularisations of linear least-squares problems (2008) (0)
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (2014) (0)
- Active-set prediction for interior point methods using controlled perturbations (2016) (0)
- Corrigendum to “Nonlinear matrix recovery using optimization on the Grassmann manifold” [Appl. Comput. Harmon. Anal. 62 (2023) 498–542] (2023) (0)
- Optimization Challenges in Data Science – Special Issue Editorial (2023) (0)
- RAL-TR-2009-023 On the complexity of steepest descent , Newton ’ s method and regularized Newton methods for nonconvex unconstrained optimization (2009) (0)
This paper list is powered by the following services:
Other Resources About Coralia Cartis
What Schools Are Affiliated With Coralia Cartis?
Coralia Cartis is affiliated with the following schools: