M. Powell
Numerical Analysis · with Beatson · 1963–2009
A researcher in the Science corpus: 16 papers; trusts 3 researchers and is trusted by 196 researchers here, as inferred from the citation graph.
Subfields
- Numerical Analysis — 13 citations into it; #19 of 3,703 by trust here, #65 by citations
- Numerical Methods & Scientific Computing — 8 citations into it; #24 of 266 by trust here, #52 by citations
- Mathematical Optimization — 7 citations into it; #26 of 422 by trust here, #54 by citations
- Applied Mathematics — 6 citations into it
- Computational Theory and Mathematics — 6 citations into it; #63 of 12,489 by trust here, #308 by citations
Whom M. Powell trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Roger Fletcher
- John A. Nelder
- Beresford N. Parlett
- Andrew R. Conn
- Katya Scheinberg
- David E. Goldberg
- Philippe L. Toint
- Tamara G. Kolda
- C. G. Broyden
Who trusts M. Powell overall
- Tamara G. Kolda
- Ya-Xiang Yuan
- Robert Michael Lewis
- Juan Peypouquet
- Rommel G. Regis
- Luis Miguel Rios
- Roger W. Koenker
- Lorenz T. Biegler
- Chengbo Li
- Junfeng Yang
Papers from M. Powell's perspective
Ordered by how strongly the researchers M. Powell trusts endorse each paper. Same corpus, a different order for every researcher.
- Function minimization by conjugate gradients
- On the convergence of derivative-free methods for unconstrained optimization
- On the Lagrange functions of quadratic models that are defined by interpolation*
- Algorithms for minimization without derivatives
- A Simplex Method for Function Minimization
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation
- Direct search algorithms for optimization calculations
- The Symmetric Eigenvalue Problem
- Genetic Algorithms in Search Optimization and Machine Learning
Their papers
- A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation (1994)
- Direct search algorithms for optimization calculations (1998)
- An efficient method for finding the minimum of a function of several variables without calculating derivatives (1964)
- The NEWUOA software for unconstrained optimization without derivatives (2006) — 555 citations
- Restart procedures for the conjugate gradient method (1977)
- UOBYQA: unconstrained optimization by quadratic approximation (2002) — 408 citations
- A New Algorithm for Unconstrained Optimization (1970)
- On the Lagrange functions of quadratic models that are defined by interpolation* (2001) — 50 citations
- The BOBYQA algorithm for bound constrained optimization without derivatives (2009) — 1,544 citations
- A View of Algorithms for Optimization without Derivatives 1 (2007) — 254 citations
- Fast evaluation of polyharmonic splines in three dimensions (2006) — 48 citations
- A Krylov subspace algorithm for multiquadric interpolation in many dimensions (2005) — 51 citations
- Nonlinear Programming—Sequential Unconstrained Minimization Techniques (1969)
- A method for nonlinear constraints in minimization problems (1969)
- Weighted Uniform Sampling — a Monte Carlo Technique for Reducing Variance (1966)
- A Rapidly Convergent Descent Method for Minimization (1963)