Skip Navigation

The Computer Journal 1967 10(3):293-296; doi:10.1093/comjnl/10.3.293
© 1967 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (138)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Zangwill, W. I.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Minimizing a function without calculating derivatives

W. I. Zangwill *

Center for Research in Management Science, University of California, Berekely, California, USA

In an important contribution Powell has suggested an approach for determining the unconstrained minimum of a function of several variables, and determining it without calculating derivatives. This paper studies his approach in some detail. It is first shown by counter-example that his basic method for minimizing a quadratic function in a finite number of iterations contains an error. His modification of his basic method is then simplified, and the simplification proven to converge for strictly convex functions. Finally, we pose a new method not only which converges in a finite number of iterations for a quadratic, but also for which theoretical convergence is established in the strictly convex case.



* Center for Research in Management Science, University of California, Berkeley, California, U.S.A.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.