M. J. D. Powell

50 papers Journal 43Unranked 4
YearRankTypeTitle / Venue / Authors
2015 J jnl
On fast trust region methods for quadratic models with linear constraints.
Math. Program. Comput.
M. J. D. Powell
2014 J jnl
The Lagrange method and SAO with bounds on the dual variables.
Optim. Methods Softw.
M. J. D. Powell
2013 J jnl
Beyond symmetric Broyden for updating quadratic models in minimization without derivatives.
Math. Program.
M. J. D. Powell
2012 J jnl
On the convergence of trust region algorithms for unconstrained minimization without derivatives.
Comput. Optim. Appl.
M. J. D. Powell
2009 — ch.
On nonlinear optimization since 1959.
The Birth of Numerical Analysis
M. J. D. Powell
2004 J jnl
Least Frobenius norm updating of quadratic models that satisfy interpolation conditions.
Math. Program.
M. J. D. Powell
2004 J jnl
On the use of quadratic models in unconstrained minimization without derivatives.
Optim. Methods Softw.
M. J. D. Powell
2003 J jnl
On trust region methods for unconstrained minimization without derivatives.
Math. Program.
M. J. D. Powell
2002 J jnl
UOBYQA: unconstrained optimization by quadratic approximation.
Math. Program.
M. J. D. Powell
2001 — conf
Radial basis function methods for interpolation to functions of many variables.
HERCMA
M. J. D. Powell
2000 J jnl
On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables.
Math. Program.
M. J. D. Powell
2000 — ed.
System Modelling and Optimization: Methods, Theory and Applications, 19th IFIP TC7 Conference on System Modelling and Optimization, July 12-16, 1999, Cambridge, UK
System Modelling and Optimization
M. J. D. Powell, Stefan Scholtes
1999 J jnl
An Optimal Way of Moving a Sequence of Points onto a Curve in Two Dimensions.
Comput. Optim. Appl.
M. J. D. Powell
1999 J jnl
Proof of convergence of an iterative technique for thin plate spline interpolation in two dimensions.
Adv. Comput. Math.
A. C. Faul, M. J. D. Powell
1995 J jnl
Some Convergence Properties of the Modified Log Barrier Method for Linear Programming.
SIAM J. Optim.
M. J. D. Powell
1993 J jnl
On the number of iterations of Karmarkar's algorithm for linear programming.
Math. Program.
M. J. D. Powell
1993 J jnl
Truncated Laurent expansions for the fast evaluation of thin plate splines.
Numer. Algorithms
M. J. D. Powell
1991 J jnl
A trust region algorithm for equality constrained optimization.
Math. Program.
M. J. D. Powell, Ya-Xiang Yuan
1991 — ch.
Univariate Multiquadric Interpolation: Some Recent Results.
Curves and Surfaces
M. J. D. Powell
1989 J jnl
A tolerant algorithm for linearly constrained optimization calculations.
Math. Program.
M. J. D. Powell
1988 J jnl
An algorithm for maximizing entropy subject to simple bounds.
Math. Program.
M. J. D. Powell
1988 J jnl
Martin Beale memorial symposium.
Math. Program.
M. J. D. Powell
1987 J jnl
Updating conjugate directions by the BFGS formula.
Math. Program.
M. J. D. Powell
1986 J jnl
A recursive quadratic programming algorithm that uses differentiable exact penalty functions.
Math. Program.
M. J. D. Powell, Ya-Xiang Yuan
1986 J jnl
How bad are the BFGS and DFP methods when the objective function is quadratic?
Math. Program.
M. J. D. Powell
1984 J jnl
On the global convergence of trust region algorithms for unconstrained minimization.
Math. Program.
M. J. D. Powell
1983 J jnl
The convergence of variable metric matrices in unconstrained optimization.
Math. Program.
Renpu Ge, M. J. D. Powell
1982 — conf
Variable Metric Methods for Constrained Optimization.
ISMP
M. J. D. Powell
1981 J jnl
A note on quasi-newton formulae for sparse second derivative matrices.
Math. Program.
M. J. D. Powell
1981 J jnl
An example of cycling in a feasible point algorithm.
Math. Program.
M. J. D. Powell
1978 J jnl
Algorithms for nonlinear constraints that use lagrangian functions.
Math. Program.
M. J. D. Powell
1977 J jnl
Piecewise Quadratic Approximations on Triangles.
ACM Trans. Math. Softw.
M. J. D. Powell, Malcolm A. Sabin
1977 J jnl
Quadratic termination properties of Davidon's new variable metric algorithm.
Math. Program.
M. J. D. Powell
1977 J jnl
Restart procedures for the conjugate gradient method.
Math. Program.
M. J. D. Powell
1976 J jnl
Some convergence properties of the conjugate gradient method.
Math. Program.
M. J. D. Powell
1975 J jnl
A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives.
ACM Trans. Math. Softw.
M. J. D. Powell
1973 J jnl
On search directions for minimization algorithms.
Math. Program.
M. J. D. Powell
1971 J jnl
Recent advances in unconstrained optimization.
Math. Program.
M. J. D. Powell
1969 J jnl
A Theorem on Rank One Modifications to a Matrix and Its Inverse.
Comput. J.
M. J. D. Powell
1969 J jnl
Book Review: Nonlinear Programming - Sequential Unconstrained Minimization Techniques, by A. V. Fiacco and G. P. McCormick, 1969; 210 pages.
Comput. J.
M. J. D. Powell
1968 — conf
A comparison of spline approximations with classical interpolation methods.
IFIP Congress (1)
M. J. D. Powell
1968 — conf
On applying Householder transformations to linear least squares problems.
IFIP Congress (1)
M. J. D. Powell, John K. Reid
1968 J jnl
On the calculation of orthogonal vectors.
Comput. J.
M. J. D. Powell
1967 J jnl
On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria.
Comput. J.
M. J. D. Powell
1966 J jnl
Necessary Conditions for a Minimax Approximation.
Comput. J.
A. R. Curtis, M. J. D. Powell
1966 J jnl
On the Convergence of Exchange Algorithms for Calculating Minimax Approximations.
Comput. J.
A. R. Curtis, M. J. D. Powell
1965 J jnl
A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives.
Comput. J.
M. J. D. Powell
1964 J jnl
An efficient method for finding the minimum of a function of several variables without calculating derivatives.
Comput. J.
M. J. D. Powell
1963 J jnl
A Rapidly Convergent Descent Method for Minimization.
Comput. J.
R. Fletcher, M. J. D. Powell
1962 J jnl
An Iterative Method for Finding Stationary Values of a Function of Several Variables.
Comput. J.
M. J. D. Powell
2025 Best paper conf
Assessing the Effectiveness of the Tigress Obfuscator Against MOPSA and BinaryNinja.
CheckMATE
Nicolò Altamura, Enrico Bragastini, Marco Campion, Mila Dalla Preda
2026 Best paper preprint
ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage.
arXiv
Chang Liu, Noah Fleischmann, Nicolò Altamura, Edward Raff, James Holt, Kristopher Micinski