Powell M.J.D.

M.J.D. Powell

Information about the author M.J.D. Powell will soon be added to the site.
Found 6 papers in total
UOBYQA: Unconstrained optimisation by quadratic approximation
UOBYQA: Unconstrained optimisation by quadratic approximation
2002
UOBYQA is a new algorithm for general unconstrained optimization calculations, that...
On the convergence of the Davidon–Fletcher–Powell algorithm for unconstrained optimization when there are only two variables
On the convergence of the Davidon–Fletcher–Powell algorithm for unconstrained optimization when there are only two variables
2000
Let the DFP algorithm for unconstrained optimization be applied to an objective...
An optimal way of moving a sequence of points onto a curve in two dimensions
An optimal way of moving a sequence of points onto a curve in two dimensions
1999
Let s (t), 0 ≤ t ≤ T , be a smooth curve and let x i , i = 1, 2, ..., n , be a...
On the number of iterations of Karmarkar’s algorithm for linear programming
On the number of iterations of Karmarkar’s algorithm for linear programming
1993
Karmarkar’s algorithm for linear programming was published in 1984, and it is...
A tolerant algorithm for linearly constrained optimization calculations
A tolerant algorithm for linearly constrained optimization calculations
1989
Two extreme techniques when choosing a search direction in a linearly constrained...
Karmarkar’s algorithm: A view from nonlinear programming
Karmarkar’s algorithm: A view from nonlinear programming
1990
Karmarkar’s algorithm for linear programming has become a highly active field of...
Papers per page: