default search action
M. J. D. Powell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j43]M. J. D. Powell:
On fast trust region methods for quadratic models with linear constraints. Math. Program. Comput. 7(3): 237-267 (2015) - 2014
- [j42]M. J. D. Powell:
The Lagrange method and SAO with bounds on the dual variables. Optim. Methods Softw. 29(2): 224-238 (2014) - 2013
- [j41]M. J. D. Powell:
Beyond symmetric Broyden for updating quadratic models in minimization without derivatives. Math. Program. 138(1-2): 475-500 (2013) - 2012
- [j40]M. J. D. Powell:
On the convergence of trust region algorithms for unconstrained minimization without derivatives. Comput. Optim. Appl. 53(2): 527-555 (2012)
2000 – 2009
- 2009
- [p2]M. J. D. Powell:
On nonlinear optimization since 1959. The Birth of Numerical Analysis 2009: 141-160 - 2004
- [j39]M. J. D. Powell:
Least Frobenius norm updating of quadratic models that satisfy interpolation conditions. Math. Program. 100(1): 183-215 (2004) - [j38]M. J. D. Powell:
On the use of quadratic models in unconstrained minimization without derivatives. Optim. Methods Softw. 19(3-4): 399-411 (2004) - 2003
- [j37]M. J. D. Powell:
On trust region methods for unconstrained minimization without derivatives. Math. Program. 97(3): 605-623 (2003) - 2002
- [j36]M. J. D. Powell:
UOBYQA: unconstrained optimization by quadratic approximation. Math. Program. 92(3): 555-582 (2002) - 2001
- [c4]M. J. D. Powell:
Radial basis function methods for interpolation to functions of many variables. HERCMA 2001: 2-24 - 2000
- [j35]M. J. D. Powell:
On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables. Math. Program. 87(2): 281-301 (2000) - [e1]M. J. D. Powell, Stefan Scholtes:
System Modelling and Optimization: Methods, Theory and Applications, 19th IFIP TC7 Conference on System Modelling and Optimization, July 12-16, 1999, Cambridge, UK. IFIP Conference Proceedings 174, Kluwer 2000, ISBN 0-7923-7881-4 [contents]
1990 – 1999
- 1999
- [j34]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): 183-192 (1999) - [j33]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): 163-185 (1999) - 1995
- [j32]M. J. D. Powell:
Some Convergence Properties of the Modified Log Barrier Method for Linear Programming. SIAM J. Optim. 5(4): 695-739 (1995) - 1993
- [j31]M. J. D. Powell:
On the number of iterations of Karmarkar's algorithm for linear programming. Math. Program. 62: 153-197 (1993) - [j30]M. J. D. Powell:
Truncated Laurent expansions for the fast evaluation of thin plate splines. Numer. Algorithms 5(2): 99-120 (1993) - 1991
- [j29]M. J. D. Powell, Ya-Xiang Yuan:
A trust region algorithm for equality constrained optimization. Math. Program. 49: 189-211 (1991) - [p1]M. J. D. Powell:
Univariate Multiquadric Interpolation: Some Recent Results. Curves and Surfaces 1991: 371-382
1980 – 1989
- 1989
- [j28]M. J. D. Powell:
A tolerant algorithm for linearly constrained optimization calculations. Math. Program. 45(1-3): 547-566 (1989) - 1988
- [j27]M. J. D. Powell:
Martin Beale memorial symposium. Math. Program. 42(1-3): 3 (1988) - [j26]M. J. D. Powell:
An algorithm for maximizing entropy subject to simple bounds. Math. Program. 42(1-3): 171-180 (1988) - 1987
- [j25]M. J. D. Powell:
Updating conjugate directions by the BFGS formula. Math. Program. 38(1): 29-46 (1987) - 1986
- [j24]M. J. D. Powell:
How bad are the BFGS and DFP methods when the objective function is quadratic? Math. Program. 34(1): 34-47 (1986) - [j23]M. J. D. Powell, Ya-Xiang Yuan:
A recursive quadratic programming algorithm that uses differentiable exact penalty functions. Math. Program. 35(3): 265-278 (1986) - 1984
- [j22]M. J. D. Powell:
On the global convergence of trust region algorithms for unconstrained minimization. Math. Program. 29(3): 297-303 (1984) - 1983
- [j21]Renpu Ge, M. J. D. Powell:
The convergence of variable metric matrices in unconstrained optimization. Math. Program. 27(2): 123-143 (1983) - 1982
- [c3]M. J. D. Powell:
Variable Metric Methods for Constrained Optimization. ISMP 1982: 288-311 - 1981
- [j20]M. J. D. Powell:
A note on quasi-newton formulae for sparse second derivative matrices. Math. Program. 20(1): 144-151 (1981) - [j19]M. J. D. Powell:
An example of cycling in a feasible point algorithm. Math. Program. 20(1): 353-357 (1981)
1970 – 1979
- 1978
- [j18]M. J. D. Powell:
Algorithms for nonlinear constraints that use lagrangian functions. Math. Program. 14(1): 224-248 (1978) - 1977
- [j17]M. J. D. Powell:
Quadratic termination properties of Davidon's new variable metric algorithm. Math. Program. 12(1): 141-147 (1977) - [j16]M. J. D. Powell:
Restart procedures for the conjugate gradient method. Math. Program. 12(1): 241-254 (1977) - [j15]M. J. D. Powell, Malcolm A. Sabin:
Piecewise Quadratic Approximations on Triangles. ACM Trans. Math. Softw. 3(4): 316-325 (1977) - 1976
- [j14]M. J. D. Powell:
Some convergence properties of the conjugate gradient method. Math. Program. 11(1): 42-49 (1976) - 1975
- [j13]M. J. D. Powell:
A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives. ACM Trans. Math. Softw. 1(2): 97-107 (1975) - 1973
- [j12]M. J. D. Powell:
On search directions for minimization algorithms. Math. Program. 4(1): 193-201 (1973) - 1971
- [j11]M. J. D. Powell:
Recent advances in unconstrained optimization. Math. Program. 1(1): 26-57 (1971)
1960 – 1969
- 1969
- [j10]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): 207-a (1969) - [j9]M. J. D. Powell:
A Theorem on Rank One Modifications to a Matrix and Its Inverse. Comput. J. 12(3): 288-290 (1969) - 1968
- [j8]M. J. D. Powell:
On the calculation of orthogonal vectors. Comput. J. 11(3): 302-304 (1968) - [c2]M. J. D. Powell:
A comparison of spline approximations with classical interpolation methods. IFIP Congress (1) 1968: 95-98 - [c1]M. J. D. Powell, John K. Reid:
On applying Householder transformations to linear least squares problems. IFIP Congress (1) 1968: 122-126 - 1967
- [j7]M. J. D. Powell:
On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria. Comput. J. 9(4): 404-407 (1967) - 1966
- [j6]A. R. Curtis, M. J. D. Powell:
Necessary Conditions for a Minimax Approximation. Comput. J. 8(4): 358-361 (1966) - [j5]A. R. Curtis, M. J. D. Powell:
On the Convergence of Exchange Algorithms for Calculating Minimax Approximations. Comput. J. 9(1): 78-80 (1966) - 1965
- [j4]M. J. D. Powell:
A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives. Comput. J. 7(4): 303-307 (1965) - 1964
- [j3]M. J. D. Powell:
An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput. J. 7(2): 155-162 (1964) - 1963
- [j2]R. Fletcher, M. J. D. Powell:
A Rapidly Convergent Descent Method for Minimization. Comput. J. 6(2): 163-168 (1963) - 1962
- [j1]M. J. D. Powell:
An Iterative Method for Finding Stationary Values of a Function of Several Variables. Comput. J. 5(2): 147-151 (1962)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: