We stand with Ukraine  

M. J. D. Powell

According to our database1, M. J. D. Powell authored at least 49 papers between 1962 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
On fast trust region methods for quadratic models with linear constraints.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program. Comput., 2015

2014
The Lagrange method and SAO with bounds on the dual variables.
[BibTeX]
[DOI]
M. J. D. Powell
Optim. Methods Softw., 2014

2013
Beyond symmetric Broyden for updating quadratic models in minimization without derivatives.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 2013

2012
On the convergence of trust region algorithms for unconstrained minimization without derivatives.
[BibTeX]
[DOI]
M. J. D. Powell
Comput. Optim. Appl., 2012

2009
On nonlinear optimization since 1959.
[BibTeX]
[DOI]
M. J. D. Powell
Proceedings of the Birth of Numerical Analysis, 2009

2004
On the use of quadratic models in unconstrained minimization without derivatives.
[BibTeX]
[DOI]
M. J. D. Powell
Optim. Methods Softw., 2004

Least Frobenius norm updating of quadratic models that satisfy interpolation conditions.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 2004

2003
On trust region methods for unconstrained minimization without derivatives.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 2003

2002
UOBYQA: unconstrained optimization by quadratic approximation.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 2002

2001
Radial basis function methods for interpolation to functions of many variables.
[BibTeX]
M. J. D. Powell
Proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 2001

2000
On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 2000

1999
An Optimal Way of Moving a Sequence of Points onto a Curve in Two Dimensions.
[BibTeX]
[DOI]
M. J. D. Powell
Comput. Optim. Appl., 1999

Proof of convergence of an iterative technique for thin plate spline interpolation in two dimensions.
[BibTeX]
[DOI]
A. C. Faul
,
M. J. D. Powell
Adv. Comput. Math., 1999

1995
Some Convergence Properties of the Modified Log Barrier Method for Linear Programming.
[BibTeX]
[DOI]
M. J. D. Powell
SIAM J. Optim., 1995

1993
Truncated Laurent expansions for the fast evaluation of thin plate splines.
[BibTeX]
[DOI]
M. J. D. Powell
Numer. Algorithms, 1993

On the number of iterations of Karmarkar's algorithm for linear programming.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1993

1991
A trust region algorithm for equality constrained optimization.
[BibTeX]
[DOI]
M. J. D. Powell
,
Ya-Xiang Yuan
Math. Program., 1991

Univariate Multiquadric Interpolation: Some Recent Results.
[BibTeX]
[DOI]
M. J. D. Powell
Proceedings of the Curves and Surfaces, 1991

1989
A tolerant algorithm for linearly constrained optimization calculations.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1989

1988
An algorithm for maximizing entropy subject to simple bounds.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1988

Martin Beale memorial symposium.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1988

1987
Updating conjugate directions by the BFGS formula.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1987

1986
A recursive quadratic programming algorithm that uses differentiable exact penalty functions.
[BibTeX]
[DOI]
M. J. D. Powell
,
Ya-Xiang Yuan
Math. Program., 1986

How bad are the BFGS and DFP methods when the objective function is quadratic?
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1986

1984
On the global convergence of trust region algorithms for unconstrained minimization.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1984

1983
The convergence of variable metric matrices in unconstrained optimization.
[BibTeX]
[DOI]
Renpu Ge
,
M. J. D. Powell
Math. Program., 1983

1982
Variable Metric Methods for Constrained Optimization.
[BibTeX]
[DOI]
M. J. D. Powell
Proceedings of the Mathematical Programming The State of the Art, 1982

1981
An example of cycling in a feasible point algorithm.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1981

A note on quasi-newton formulae for sparse second derivative matrices.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1981

1978
Algorithms for nonlinear constraints that use lagrangian functions.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1978

1977
Piecewise Quadratic Approximations on Triangles.
[BibTeX]
[DOI]
M. J. D. Powell
,
Malcolm A. Sabin
ACM Trans. Math. Softw., 1977

Restart procedures for the conjugate gradient method.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1977

Quadratic termination properties of Davidon's new variable metric algorithm.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1977

1976
Some convergence properties of the conjugate gradient method.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1976

1975
A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives.
[BibTeX]
[DOI]
M. J. D. Powell
ACM Trans. Math. Softw., 1975

1973
On search directions for minimization algorithms.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1973

1971
Recent advances in unconstrained optimization.
[BibTeX]
[DOI]
M. J. D. Powell
Math. Program., 1971

1969
A Theorem on Rank One Modifications to a Matrix and Its Inverse.
[BibTeX]
[DOI]
M. J. D. Powell
Comput. J., 1969

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

1968
On the calculation of orthogonal vectors.
[BibTeX]
[DOI]
M. J. D. Powell
Comput. J., 1968

On applying Householder transformations to linear least squares problems.
[BibTeX]
M. J. D. Powell
,
John K. Reid
Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968

A comparison of spline approximations with classical interpolation methods.
[BibTeX]
M. J. D. Powell
Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968

1967
On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria.
[BibTeX]
[DOI]
M. J. D. Powell
Comput. J., 1967

1966
Necessary Conditions for a Minimax Approximation.
[BibTeX]
[DOI]
A. R. Curtis
,
M. J. D. Powell
Comput. J., 1966

On the Convergence of Exchange Algorithms for Calculating Minimax Approximations.
[BibTeX]
[DOI]
A. R. Curtis
,
M. J. D. Powell
Comput. J., 1966

1965
A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives.
[BibTeX]
[DOI]
M. J. D. Powell
Comput. J., 1965

1964
An efficient method for finding the minimum of a function of several variables without calculating derivatives.
[BibTeX]
[DOI]
M. J. D. Powell
Comput. J., 1964

1963
A Rapidly Convergent Descent Method for Minimization.
[BibTeX]
[DOI]
R. Fletcher
,
M. J. D. Powell
Comput. J., 1963

1962
An Iterative Method for Finding Stationary Values of a Function of Several Variables.
[BibTeX]
[DOI]
M. J. D. Powell
Comput. J., 1962


  Loading...