default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCoralia Cartis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i17]Florentin Goyens, Coralia Cartis, Stéphane Chrétien:
Registration of algebraic varieties using Riemannian optimization. CoRR abs/2401.08562 (2024)- [i16]Wenqi Zhu, Coralia Cartis:
Global Convergence of High-Order Regularization Methods with Sums-of-Squares Taylor Models. CoRR abs/2404.03035 (2024) - 2023
- [j36]Coralia Cartis, Panayotis Mertikopoulos:
Optimization Challenges in Data Science - Special Issue Editorial. EURO J. Comput. Optim. 11: 100064 (2023) - [j35]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): 997-1058 (2023) - [j34]Coralia Cartis, Lindon Roberts:
Scalable subspace methods for derivative-free nonlinear least-squares optimization. Math. Program. 199(1): 461-524 (2023) - [j33]Coralia Cartis, Estelle M. Massart, Adilet Otemissov:
Global optimization using random embeddings. Math. Program. 200(2): 781-829 (2023) - [i15]Coralia Cartis, Wenqi Zhu:
Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods. CoRR abs/2308.15336 (2023) - [i14]Wenqi Zhu, Coralia Cartis:
Cubic-quartic regularization models for solving polynomial subproblems in third-order tensor methods. CoRR abs/2312.10283 (2023) - 2022
- [i13]Coralia Cartis, Jaroslav M. Fowkes, Zhen Shao:
A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares. CoRR abs/2211.05727 (2022) - 2021
- [j32]Naman Agarwal, Nicolas Boumal, Brian Bullins, Coralia Cartis:
Adaptive regularization with cubics on manifolds. Math. Program. 188(1): 85-134 (2021) - [i12]Coralia Cartis, Jan Fiala, Zhen Shao:
Hashing embeddings of optimal dimension, with applications to linear least squares. CoRR abs/2105.11815 (2021) - [i11]Coralia Cartis, Estelle M. Massart, Adilet Otemissov:
Global optimization using random embeddings. CoRR abs/2107.12102 (2021) - [i10]Florentin Goyens, Coralia Cartis, Armin Eftekhari:
Nonlinear matrix recovery using optimization on the Grassmann manifold. CoRR abs/2109.06095 (2021) - 2020
- [j31]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): 243-256 (2020) - [j30]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): 513-541 (2020) - [i9]Coralia Cartis, Tyler Ferguson, Lindon Roberts:
Scalable Derivative-Free Optimization for Nonlinear Least-Squares Problems. CoRR abs/2007.13243 (2020)
2010 – 2019
- 2019
- [j29]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): 92-119 (2019) - [j28]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: 68-94 (2019) - [j27]Coralia Cartis, Lindon Roberts:
A derivative-free Gauss-Newton method. Math. Program. Comput. 11(4): 631-674 (2019) - [j26]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): 595-615 (2019) - [j25]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): 32:1-32:41 (2019) - 2018
- [j24]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): 1073-1107 (2018) - [j23]Coralia Cartis, Katya Scheinberg:
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169(2): 337-375 (2018) - [c1]Wayne Arter, Ana Osojnik, Coralia Cartis, Godwin Madho, Chris A. Jones, Steven Tobias:
Data assimilation approach to analysing systems of ordinary differential equations. ISCAS 2018: 1-5 - [i8]Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. CoRR abs/1811.01220 (2018) - 2017
- [j22]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): 611-626 (2017) - [j21]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): 1273-1298 (2017) - [j20]Coralia Cartis, Andrew Thompson:
Quantitative Recovery Conditions for Tree-Based Compressed Sensing. IEEE Trans. Inf. Theory 63(3): 1555-1571 (2017) - [i7]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 abs/1705.04895 (2017) - [i6]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 abs/1705.07285 (2017) - [i5]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. CoRR abs/1708.04044 (2017) - 2016
- [j19]Coralia Cartis, Yiming Yan:
Active-set prediction for interior point methods using controlled perturbations. Comput. Optim. Appl. 63(3): 639-684 (2016) - [i4]Coralia Cartis, Andrew Thompson:
Quantitative recovery conditions for tree-based compressed sensing. CoRR abs/1609.02071 (2016) - 2015
- [j18]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): 429-457 (2015) - [j17]Coralia Cartis, Andreas Griewank, Philippe L. Toint, Ya-Xiang Yuan:
Obituary for Mike Powell. Optim. Methods Softw. 30(3): 669-671 (2015) - [j16]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): 836-851 (2015) - [j15]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): 2019-2042 (2015) - 2014
- [j14]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): 93-106 (2014) - 2013
- [j13]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): 451-457 (2013) - [j12]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): 1553-1574 (2013) - [j11]Coralia Cartis, Andrew Thompson:
An Exact Tree Projection Algorithm for Wavelets. IEEE Signal Process. Lett. 20(11): 1028-1031 (2013) - [i3]Coralia Cartis, Andrew Thompson:
A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing. CoRR abs/1309.5406 (2013) - 2012
- [j10]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28(1): 93-108 (2012) - [j9]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): 197-219 (2012) - [j8]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): 66-86 (2012) - 2011
- [j7]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): 245-295 (2011) - [j6]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): 295-319 (2011) - [j5]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): 1721-1739 (2011) - [j4]Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner:
Compressed Sensing: How Sharp Is the Restricted Isometry Property? SIAM Rev. 53(1): 105-125 (2011) - 2010
- [j3]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): 2833-2852 (2010) - [j2]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): 1-29 (2010) - [i2]Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner, Andrew Thompson:
Phase Transitions for Greedy Sparse Approximation Algorithms. CoRR abs/1004.1821 (2010) - [i1]Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner:
Compressed Sensing: How sharp is the Restricted Isometry Property. CoRR abs/1004.5026 (2010)
2000 – 2009
- 2009
- [j1]Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner:
Decay Properties of Restricted Isometry Constants. IEEE Signal Process. Lett. 16(7): 572-575 (2009)
Coauthor Index
aka: Nick I. M. Gould
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-31 01:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
