Advertisement

Optimization algorithms in 1979

  • M. J. D. Powell
Plenary Lectures
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 22)

Keywords

Quadratic Programming Line Search Conjugate Gradient Method Active Constraint Conjugate Gradient Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M.C. Biggs, “Constrained minimization using recursive equality quadratic programming” in Numerical methods for nonlinear optimization, ed: F.A. Lootsma, Academic Press (London, 1972).Google Scholar
  2. [2]
    K. Brown, M. Minkoff, K. Hillstrom, L. Nazareth, J. Pool and B. Smith, “Progress in the development of a modularized package of algorithms for optimization problems” in Optimization in action, ed: L.C.W. Dixon, Academic Press (London, 1976).Google Scholar
  3. [3]
    A. Buckley, “A combined conjugate-gradient quasi-Newton minimization algorithm”, Mathematical Programming, 15 (1978) 200–210.Google Scholar
  4. [4]
    R.M. Chamberlain, C. Lemaréchal, H.C. Pedersen and M.J.D. Powell, “The watchdog technique for forcing convergence in algorithms for constrained optimization”, Tenth International Symposium on Mathematical Programming (Montreal, 1979).Google Scholar
  5. [5]
    A.R. Colville, “A comparative study on nonlinear programming codes”, Report No. 320–2949 (IBM New York Scientific Center, 1968).Google Scholar
  6. [6]
    W.C. Davidon, “Optimally conditioned optimization algorithms without line searches”, Mathematical Programming, 9 (1975) 1–30.Google Scholar
  7. [7]
    W.C. Davidon, “Conic approximations and collinear scalings for optimizers”, internal report (Haverford College, U.S.A., 1979).Google Scholar
  8. [8]
    R.S. Dembo, “A set of geometric test problems and their solutions”, Mathematical Programming, 10 (1976) 192–213.Google Scholar
  9. [9]
    J.E. Dennis and J.J. Moré, “Quasi-Newton methods, motivation and theory”, SIAM Review, 19 (1977) 46–89.Google Scholar
  10. [10]
    R. Fletcher, “Minimizing general functions subject to linear constraints”, in Numerical methods for nonlinear optimization, ed: F.A. Lootsma, Academic Press (London, 1972).Google Scholar
  11. [11]
    R. Fletcher, “An ideal penalty function for constrained optimization”, J. Inst. Maths Applics, 15 (1975) 319–342.Google Scholar
  12. [12]
    D. Goldfarb, “Extension of Davidon's variable metric method to maximization under linear inequality and equality constraints”, SIAM J. Appl. Maths, 17 (1969) 739–764.Google Scholar
  13. [13]
    M.J. Hopper, “Harwell Subroutine Library: A catalogue of subroutines (1978)” Report No. R 9185 (AERE, Harwell, England, 1978).Google Scholar
  14. [14]
    J.J. Moré, “Implementation and testing of optimization software”, Report No. DAMTP 79/NA 4 (University of Cambridge, 1979).Google Scholar
  15. [15]
    B.A. Murtagh and M.A. Saunders, “Large scale linearly constrained optimization”, Mathematical Programming, 14 (1978) 41–72.Google Scholar
  16. [16]
    M.J.D. Powell, “Quadratic termination properties of minimization algorithms I”, J. Inst. Maths Applics, 10 (1972) 333–342.Google Scholar
  17. [17]
    M.J.D. Powell, “Restart procedures for the conjugate gradient method”, Mathematical Programming, 12 (1977) 241–254.Google Scholar
  18. [18]
    M.J.D. Powell, “A fast algorithm for nonlinearly constrained optimization calculations”, in Numerical Analysis, Dundee 1977, ed: G.A. Watson, Lecture Notes in Mathematics No. 630, Springer-Verlag (Berlin, 1978).Google Scholar
  19. [19]
    M.J.D. Powell, “Quasi-Newton formulae for sparse second derivative matrices”, Report No. DAMTP 79/NA 7 (University of Cambridge, 1979).Google Scholar
  20. [20]
    M.J.D. Powell and Ph. L. Toint, “On the estimation of sparse Hessian matrices”, to be published in SIAM J. Numerical Analysis.Google Scholar
  21. [21]
    K. Schittkowski, “Randomly generated nonlinear programming test problems and their application to compare optimization programs”, Ninth IFIP Conference on Optimization Techniques (Warsaw, 1979).Google Scholar
  22. [22]
    Ph.L. Toint, “On sparse and symmetric updating subject to a linear equation”, Mathematics of Computation, 31 (1977) 954–961.Google Scholar

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

  • M. J. D. Powell
    • 1
  1. 1.Department of Applied Mathematics and Theoretical PhysicsUniversity of CambridgeEngland

Personalised recommendations