M. J. D. Powell

Publication Activity (10 Years)

Years Active: 1962-2015
Publications (10 Years): 1

Top Topics

Optimization Methods

Convergence Rate

Linear Constraints

Top Venues

Comput. Optim. Appl.

Math. Program. Comput.

Optim. Methods Softw.

Publications

M. J. D. Powell
On fast trust region methods for quadratic models with linear constraints. Math. Program. Comput. 7 (3) (2015)
M. J. D. Powell
The Lagrange method and SAO with bounds on the dual variables. Optim. Methods Softw. 29 (2) (2014)
M. J. D. Powell
Beyond symmetric Broyden for updating quadratic models in minimization without derivatives. Math. Program. 138 (1-2) (2013)
M. J. D. Powell
On the convergence of trust region algorithms for unconstrained minimization without derivatives. Comput. Optim. Appl. 53 (2) (2012)
M. J. D. Powell
On the use of quadratic models in unconstrained minimization without derivatives. Optim. Methods Softw. 19 (3-4) (2004)
M. J. D. Powell
Least Frobenius norm updating of quadratic models that satisfy interpolation conditions. Math. Program. 100 (1) (2004)
M. J. D. Powell
On trust region methods for unconstrained minimization without derivatives. Math. Program. 97 (3) (2003)
M. J. D. Powell
UOBYQA: unconstrained optimization by quadratic approximation. Math. Program. 92 (3) (2002)
M. J. D. Powell
Radial basis function methods for interpolation to functions of many variables. HERCMA (2001)
M. J. D. Powell
On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables. Math. Program. 87 (2) (2000)
M. J. D. Powell
An Optimal Way of Moving a Sequence of Points onto a Curve in Two Dimensions. Comput. Optim. Appl. 13 (1-3) (1999)
A. C. Faul, M. J. D. Powell
Proof of convergence of an iterative technique for thin plate spline interpolation in two dimensions. Adv. Comput. Math. 11 (2-3) (1999)
M. J. D. Powell
Some Convergence Properties of the Modified Log Barrier Method for Linear Programming. SIAM J. Optim. 5 (4) (1995)
M. J. D. Powell
Truncated Laurent expansions for the fast evaluation of thin plate splines. Numer. Algorithms 5 (2) (1993)
M. J. D. Powell
On the number of iterations of Karmarkar's algorithm for linear programming. Math. Program. 62 (1993)
M. J. D. Powell, Ya-Xiang Yuan
A trust region algorithm for equality constrained optimization. Math. Program. 49 (1991)
M. J. D. Powell
A tolerant algorithm for linearly constrained optimization calculations. Math. Program. 45 (1-3) (1989)
M. J. D. Powell
An algorithm for maximizing entropy subject to simple bounds. Math. Program. 42 (1-3) (1988)
M. J. D. Powell
Martin Beale memorial symposium. Math. Program. 42 (1-3) (1988)
M. J. D. Powell
Updating conjugate directions by the BFGS formula. Math. Program. 38 (1) (1987)
M. J. D. Powell
How bad are the BFGS and DFP methods when the objective function is quadratic? Math. Program. 34 (1) (1986)
M. J. D. Powell, Ya-Xiang Yuan
A recursive quadratic programming algorithm that uses differentiable exact penalty functions. Math. Program. 35 (3) (1986)
M. J. D. Powell
On the global convergence of trust region algorithms for unconstrained minimization. Math. Program. 29 (3) (1984)
Renpu Ge, M. J. D. Powell
The convergence of variable metric matrices in unconstrained optimization. Math. Program. 27 (2) (1983)
M. J. D. Powell
Variable Metric Methods for Constrained Optimization. ISMP (1982)
M. J. D. Powell
A note on quasi-newton formulae for sparse second derivative matrices. Math. Program. 20 (1) (1981)
M. J. D. Powell
An example of cycling in a feasible point algorithm. Math. Program. 20 (1) (1981)
M. J. D. Powell
Algorithms for nonlinear constraints that use lagrangian functions. Math. Program. 14 (1) (1978)
M. J. D. Powell
Restart procedures for the conjugate gradient method. Math. Program. 12 (1) (1977)
M. J. D. Powell, Malcolm A. Sabin
Piecewise Quadratic Approximations on Triangles. ACM Trans. Math. Softw. 3 (4) (1977)
M. J. D. Powell
Quadratic termination properties of Davidon's new variable metric algorithm. Math. Program. 12 (1) (1977)
M. J. D. Powell
Some convergence properties of the conjugate gradient method. Math. Program. 11 (1) (1976)
M. J. D. Powell
A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives. ACM Trans. Math. Softw. 1 (2) (1975)
M. J. D. Powell
On search directions for minimization algorithms. Math. Program. 4 (1) (1973)
M. J. D. Powell
Recent advances in unconstrained optimization. Math. Program. 1 (1) (1971)
M. J. D. Powell
Book Review: Nonlinear Programming - Sequential Unconstrained Minimization Techniques, by A. V. Fiacco and G. P. McCormick, 1969; 210 pages. Comput. J. 12 (3) (1969)
M. J. D. Powell
A Theorem on Rank One Modifications to a Matrix and Its Inverse. Comput. J. 12 (3) (1969)
M. J. D. Powell
On the calculation of orthogonal vectors. Comput. J. 11 (3) (1968)
M. J. D. Powell
A comparison of spline approximations with classical interpolation methods. IFIP Congress (1) (1968)
M. J. D. Powell, John K. Reid
On applying Householder transformations to linear least squares problems. IFIP Congress (1) (1968)
M. J. D. Powell
On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria. Comput. J. 9 (4) (1967)
A. R. Curtis, M. J. D. Powell
Necessary Conditions for a Minimax Approximation. Comput. J. 8 (4) (1966)
A. R. Curtis, M. J. D. Powell
On the Convergence of Exchange Algorithms for Calculating Minimax Approximations. Comput. J. 9 (1) (1966)
M. J. D. Powell
A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives. Comput. J. 7 (4) (1965)
M. J. D. Powell
An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput. J. 7 (2) (1964)
R. Fletcher, M. J. D. Powell
A Rapidly Convergent Descent Method for Minimization. Comput. J. 6 (2) (1963)
M. J. D. Powell
An Iterative Method for Finding Stationary Values of a Function of Several Variables. Comput. J. 5 (2) (1962)