An Iterative Method for Finding Stationary Values of a Function of Several Variables. - M. J. D. Powell (Comput. J., 1962)

A Rapidly Convergent Descent Method for Minimization. - R. Fletcher; M. J. D. Powell (Comput. J., 1963)

An efficient method for finding the minimum of a function of several variables without calculating derivatives. - M. J. D. Powell (Comput. J., 1964)

A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives. - M. J. D. Powell (Comput. J., 1965)

On the Convergence of Exchange Algorithms for Calculating Minimax Approximations. - A. R. Curtis; M. J. D. Powell (Comput. J., 1966)

Necessary Conditions for a Minimax Approximation. - A. R. Curtis; M. J. D. Powell (Comput. J., 1966)

On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria. - M. J. D. Powell (Comput. J., 1967)

A comparison of spline approximations with classical interpolation methods. - M. J. D. Powell (IFIP Congress (1), 1968)

On applying Householder transformations to linear least squares problems. - M. J. D. Powell; John K. Reid (IFIP Congress (1), 1968)

On the calculation of orthogonal vectors. - M. J. D. Powell (Comput. J., 1968)

Book Review: Nonlinear Programming - Sequential Unconstrained Minimization Techniques, by A. V. Fiacco and G. P. McCormick, 1969; 210 pages. - M. J. D. Powell (Comput. J., 1969)

A Theorem on Rank One Modifications to a Matrix and Its Inverse. - M. J. D. Powell (Comput. J., 1969)

Recent advances in unconstrained optimization. - M. J. D. Powell (Math. Program., 1971)

On search directions for minimization algorithms. - M. J. D. Powell (Math. Program., 1973)

A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives. - M. J. D. Powell (ACM Trans. Math. Softw., 1975)

Some convergence properties of the conjugate gradient method. - M. J. D. Powell (Math. Program., 1976)

Quadratic termination properties of Davidon's new variable metric algorithm. - M. J. D. Powell (Math. Program., 1977)

Restart procedures for the conjugate gradient method. - M. J. D. Powell (Math. Program., 1977)

Piecewise Quadratic Approximations on Triangles. - M. J. D. Powell; Malcolm A. Sabin (ACM Trans. Math. Softw., 1977)

Algorithms for nonlinear constraints that use lagrangian functions. - M. J. D. Powell (Math. Program., 1978)

A note on quasi-newton formulae for sparse second derivative matrices. - M. J. D. Powell (Math. Program., 1981)

An example of cycling in a feasible point algorithm. - M. J. D. Powell (Math. Program., 1981)

Variable Metric Methods for Constrained Optimization. - M. J. D. Powell (ISMP, 1982)

The convergence of variable metric matrices in unconstrained optimization. - Renpu Ge; M. J. D. Powell (Math. Program., 1983)

On the global convergence of trust region algorithms for unconstrained minimization. - M. J. D. Powell (Math. Program., 1984)

How bad are the BFGS and DFP methods when the objective function is quadratic? - M. J. D. Powell (Math. Program., 1986)

A recursive quadratic programming algorithm that uses differentiable exact penalty functions. - M. J. D. Powell; Ya-Xiang Yuan (Math. Program., 1986)

Updating conjugate directions by the BFGS formula. - M. J. D. Powell (Math. Program., 1987)

Martin Beale memorial symposium. - M. J. D. Powell (Math. Program., 1988)

An algorithm for maximizing entropy subject to simple bounds. - M. J. D. Powell (Math. Program., 1988)

A tolerant algorithm for linearly constrained optimization calculations. - M. J. D. Powell (Math. Program., 1989)

Univariate Multiquadric Interpolation: Some Recent Results. - M. J. D. Powell (Curves and Surfaces, 1991)

A trust region algorithm for equality constrained optimization. - M. J. D. Powell; Ya-Xiang Yuan (Math. Program., 1991)

On the number of iterations of Karmarkar's algorithm for linear programming. - M. J. D. Powell (Math. Program., 1993)

Truncated Laurent expansions for the fast evaluation of thin plate splines. - M. J. D. Powell (Numer. Algorithms, 1993)

Some Convergence Properties of the Modified Log Barrier Method for Linear Programming. - M. J. D. Powell (SIAM J. Optim., 1995)

Proof of convergence of an iterative technique for thin plate spline interpolation in two dimensions. - A. C. Faul; M. J. D. Powell (Adv. Comput. Math., 1999)

An Optimal Way of Moving a Sequence of Points onto a Curve in Two Dimensions. - M. J. D. Powell (Comput. Optim. Appl., 1999)

On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables. - M. J. D. Powell (Math. Program., 2000)

Radial basis function methods for interpolation to functions of many variables. - M. J. D. Powell (HERCMA, 2001)

UOBYQA: unconstrained optimization by quadratic approximation. - M. J. D. Powell (Math. Program., 2002)

On trust region methods for unconstrained minimization without derivatives. - M. J. D. Powell (Math. Program., 2003)

Least Frobenius norm updating of quadratic models that satisfy interpolation conditions. - M. J. D. Powell (Math. Program., 2004)

On the use of quadratic models in unconstrained minimization without derivatives. - M. J. D. Powell (Optim. Methods Softw., 2004)

On nonlinear optimization since 1959. - M. J. D. Powell (The Birth of Numerical Analysis, 2009)

On the convergence of trust region algorithms for unconstrained minimization without derivatives. - M. J. D. Powell (Comput. Optim. Appl., 2012)

Beyond symmetric Broyden for updating quadratic models in minimization without derivatives. - M. J. D. Powell (Math. Program., 2013)

The Lagrange method and SAO with bounds on the dual variables. - M. J. D. Powell (Optim. Methods Softw., 2014)

On fast trust region methods for quadratic models with linear constraints. - M. J. D. Powell (Math. Program. Comput., 2015)