A projected lagrangian algorithm for semi-infinite programming. - Ian D. Coope; G. Alistair Watson (Math. Program., 1985)

On the calculation of minimum variance estimators for unobservable dependent variables. - Ian D. Coope (Comput. Optim. Appl., 1993)

The rise and fall of the vector epsilon algorithm. - Ian D. Coope; Peter R. Graves-Morris (Numer. Algorithms, 1993)

Numerical experiments in semi-infinite programming. - Christopher John Price; Ian D. Coope (Comput. Optim. Appl., 1996)

On the Convergence of Grid-Based Methods for Unconstrained Optimization. - Ian D. Coope; Christopher John Price (SIAM J. Optim., 2001)

Positive Bases in Numerical Optimization. - Ian D. Coope; Christopher John Price (Comput. Optim. Appl., 2002)

Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach. - Christopher John Price; Ian D. Coope (SIAM J. Optim., 2003)

Conjugate Grids for Unconstrained Optimisation. - D. Byatt; Ian D. Coope; Christopher John Price (Comput. Optim. Appl., 2004)

A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing - Robert L. Broughton; Ian D. Coope; Peter Renaud; Rachael Tappenden (CoRR, 2009)

On calculating generalized Cayley transforms of bounded norm. - Ian D. Coope (Numer. Algorithms, 2009)

Determinant and Exchange Algorithms for Observation Subset Selection. - Robert L. Broughton; Ian D. Coope; Peter Renaud; Rachael Tappenden (IEEE Trans. Image Process., 2010)

A box constrained gradient projection algorithm for compressed sensing. - Robert L. Broughton; Ian D. Coope; Peter F. Renaud; Rachael Tappenden (Signal Process., 2011)

Efficient calculation of regular simplex gradients. - Ian D. Coope; Rachael Tappenden (Comput. Optim. Appl., 2019)

Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases. - Ian D. Coope; Rachael Tappenden (Numer. Algorithms, 2021)