Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming by Cartis, C

Some Disadvantages of a Mehrotra-Type Primal-Dual Corrector Interior Point Algorithm for Linear Programming by Cartis, C

Some New Results Concerning the Primal-Dual Path-Following Interior Point Algorithm for Linear Programming by Cartis, C

On the convergence of a primal-dual second-order corrector interior point algorithm for linear programming by Cartis, C

A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing by Cartis, C, Thompson, A

A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing by Cartis, C, Thompson, A

A new perspective on the complexity of interior point methods for linear programming by Cartis, C, Hauser, R

Quantitative recovery conditions for tree-based compressed sensing by Cartis, C, Thompson, A

A dimensionality reduction technique for unconstrained global optimization of functions with low effective dimensionality by Cartis, C, Otemissov, A

Global convergence rate analysis of unconstrained optimization methods based on probabilistic models by Cartis, C, Scheinberg, K

A new perspective on the complexity of interior point methods for linear programming by Cartis, C, Hauser, R

A derivative-free Gauss–Newton method by Roberts, L, Cartis, C

Active-set prediction for interior point methods using controlled perturbations by Cartis, C, Yan, Y

Data for paper "A Derivative-Free Gauss-Newton Method" by Cartis, C, Roberts, L

Other Authors: “…Cartis, C…”

An exact tree projection algorithm for wavelets by Cartis, C, Thompson, A

Scalable subspace methods for derivative-free nonlinear least-squares optimization by Cartis, C, Roberts, L

Finding a point in the relative interior of a polyhedron by Cartis, C, Gould, N

Data for paper "Improving the Flexibility and Robustness of Model-Based Derivative-Free Optimization Solvers" by Roberts, L, Cartis, C

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. by Cartis, C, Gould, N, Toint, P

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models by Cartis, C, Gould, N, Toint, P