Practical Methods of Optimization and over one million other books are available for Amazon Kindle. Learn more
  • List Price: $104.00
  • Save: $59.52 (57%)
Rented from RentU
To Rent, select Shipping State from options above
Due Date: Dec 19, 2014
FREE return shipping at the end of the semester. Access codes and supplements are not guaranteed with rentals.
Used: Good | Details
Sold by RentU
Condition: Used: Good
Comment: Fast shipping from Amazon! Qualifies for Prime Shipping and FREE standard shipping for orders over $35. Overnight, 2 day and International shipping available! Excellent Customer Service.. May not include supplements such as CD, access code or DVD.
Access codes and supplements are not guaranteed with used items.
Add to Cart
  • List Price: $104.00
  • Save: $19.24 (19%)
In Stock.
Ships from and sold by
Gift-wrap available.
Add to Cart
Trade in your item
Get a $29.41
Gift Card.
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Practical Methods of Optimization Paperback – May 1, 2000

ISBN-13: 978-0471494638 ISBN-10: 0471494631 Edition: 2nd

Buy New
Price: $84.76
Price: $44.48
19 New from $77.68 17 Used from $74.63
Rent from Amazon Price New from Used from
"Please retry"
"Please retry"
$263.35 $62.23
"Please retry"
$77.68 $74.63


Frequently Bought Together

Practical Methods of Optimization + Numerical Optimization (Springer Series in Operations Research and Financial Engineering) + Convex Optimization
Price for all three: $224.34

Buy the selected items together

Customers Who Bought This Item Also Bought


Save up to 90% on Textbooks
Rent textbooks, buy textbooks, or get up to 80% back when you sell us your books. Shop Now

Product Details

  • Paperback: 456 pages
  • Publisher: Wiley; 2 edition (May 2000)
  • Language: English
  • ISBN-10: 0471494631
  • ISBN-13: 978-0471494638
  • Product Dimensions: 9.1 x 5.9 x 1.2 inches
  • Shipping Weight: 1.4 pounds (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (7 customer reviews)
  • Amazon Best Sellers Rank: #567,671 in Books (See Top 100 in Books)

Editorial Reviews

From the Back Cover

This established textbook is noted for its coverage of optimization methods that are of practical importance. It provides a thorough treatment of standard methods such as linear and quadratic programming, Newton-like methods and the conjugate gradient method. The theoretical aspects of the subject include an extended treatment of optimality conditions and the significance of Lagrange multipliers. The relevance of convexity theory to optimization is also not neglected. A significant proportion of the book is devoted to the solution of nonlinear problems, with an authoritative treatment of current methodology. Thus state of the art techniques such as the BFGS method, trust region methods and the SQP method are described and analysed. Other features are an extensive treatment of nonsmooth optimization and the L_1 penalty function. Contents Part 1 Unconstrained Optimization Part 2 Constrained Optimization
* Introduction
* Structure of Methods
* Newton-like Methods
* Conjugate Direction Methods
* Restricted Step Methods
* Sums of Squares and Nonlinear Equations
* Introduction
* Linear Programming
* The Theory of Constrained Optimization
* Quadratic Programming
* General Linearly Constrained Optimization
* Nonlinear Programming
* Other Optimization Problems

About the Author

About the author Professor Roger Fletcher completed his MA at the University of Cambridge in 1960 and his PhD at the University of Leeds in 1963. He was a lecturer at the University of Leeds from 1963 to 1969, then Principal Scientific Officer at AERE Harwell until 1973. He then joined the University of Dundee where he is Professor of Optimization and holds the Baxter Chair of Mathematics. In 1997 he was awarded the prestigious Dantzig Prize for fundamental contributions to algorithms for nonlinear optimization, awarded jointly by the Society for Industrial and Applied Mathematics and the Mathematical Programming Society. He is a Fellow of the Royal Society of Edinburgh and of the Institute of Mathematics and its Applications.

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

5.0 out of 5 stars
5 star
4 star
3 star
2 star
1 star
See all 7 customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

32 of 35 people found the following review helpful By B. H. on July 27, 2001
Format: Paperback
This is a very well-written book. It achieved both mathematical clearness and simplicity. I especially like the first part, unconstrained optimization. On the one hand, unconstrained optimization is very widely used. On the other hand, there isn't much content in it. Yet, there aren't many books explaining this small area clearly. This book starts with describing the structures of all methods, which gives you a sort of bird's eye view. It then devotes one chapter to each of the 3 major families of optimization methods. Comparing with another popular book, Numerical Recipes, which is orgnized by individual algorithms, this book will cerntainly gives the reader better understanding of the essence of all the algorithms. And as the name says, it's about 'practial' methods. You'll have no problem to implement the algorithms in the book and there are also many working examples to help you see how an algorithm works and help verify the implementation.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
20 of 22 people found the following review helpful By J. Donahue on June 12, 2002
Format: Paperback
This is a good book from an award winning author and researcher in this subject. However, the 2000 publication date shown refers to the release of the paperback version. There is no new content since 1987 when the 2nd ed. was originally published in hardcover.
I prefer Dennis and Schnabel's _Numerical Methods for Unconstrained Optimization and Nonlinear Equations_ for Newton-derived methods in unconstrained optimization, but Fletcher's book has the added material on constrained optimization (Part 2) that makes it more complete if one wants a single reference that covers the gamut of optimization.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
13 of 14 people found the following review helpful By A mathematically-oriented reader on December 15, 2004
Format: Paperback
I recommend this book for anybody needing to learn the basics of optimization as well as a reference for people already in the field. Dr. Fletcher covers the basics, advantages, and disadvantages of optimization methods capitalizing on his long experience on the field. I find the book to be clearly written and easy to follow. Although notation is clearly explained when introduced, the author gives a notation summary at the begining of the book. This makes the book usefull as a learning as well as a reference. Although the book has not changed since the second edition, the optimization methods it describes are still the most-widely-applicable ones.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
6 of 6 people found the following review helpful By K. Dixon on June 28, 2008
Format: Paperback Verified Purchase
This book is a great mix of insight and rigor. The text is mixed with mathematical propositions/proofs and a lively writing style. The proofs aren't gratuitous, as opposed to most texts, but meant to build insight and demonstrate properties of algorithms. After each proof Fletcher doesn't meander in the weeds of the math, but he takes a step back and provides insight about WHAT this means for a particular algorithm.

Fletcher then highlights the algorithms by bringing in his own experience and provides insight on how the algorithms work on real problems, not just what the theory says. He writes that many algorithms, including several developed by him, are inferior to other variants on real-world problems. (Fletcher is the "F" in BFGS, DFP, and Fletcher-Reeves conjugate gradient.)

This coupling of mathematical rigor with candid insight makes this book invaluable.

On the negative side, I have found (as others have noted) a few typos, including a couple obvious ones in the pseudocode. This book is meant "to teach a man to fish," not "give a man a fish." So, if you're looking for something like Numerical Recipes that gives you verbatim software to type into your computer, then Fletcher's book isn't for you. However, after digesting Fletcher's math and insight, I have been able to reduce the computation of my (formerly NR-based) codes by an order of magnitude on some standard-battery optimizations.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Customer Images


What Other Items Do Customers Buy After Viewing This Item?