Wiley Publishers Since 1807  Shopping Cart  Shopping Cart  My Account  Help  Contact Us  
Home Browse Titles Offers About Wiley
 
Product Search
Wiley > Mathematics & Statistics > Discrete Mathematics > Practical Methods of Optimization, 2nd Edition
Related Subjects
General Interest Computer Science

General Computer Engineering

Finite Mathematics

General Statistics

Geometry & Topology

Logic & Foundations

Special Topics in Mathematics



Related Titles
Discrete Mathematics

Ramsey Theory, 2nd Edition (Hardcover)
by Ronald L. Graham, Bruce L. Rothschild, Joel H. Spencer

Graphs: Theory and Algorithms (Hardcover)
by K. Thulasiraman, M. N. S. Swamy

Introduction to Practical Linear Programming (Hardcover)
by David J. Pannell

Contemporary Design Theory: A Collection of Surveys (Hardcover)
by Jeffrey H. Dinitz (Editor), Douglas R. Stinson (Editor)

Evolution of Random Search Trees (Hardcover)
by Hosam M. Mahmoud

Modified Lagrangians and Monotone Maps in Optimization (Hardcover)
by E. G. Golshtein, N. V. Tretyakov

Coding Theory, Design Theory, Group Theory: Proceedings of The Marshall Hall Conference (Hardcover)
by D. Jungnickel (Editor), S. A. Vanstone (Editor)



Join the Mailing List
Join a Mathematics & Statistics Mailing List
Discrete Mathematics
Practical Methods of Optimization, 2nd Edition
R. Fletcher
ISBN: 0-471-49463-1
Paperback
450 pages
June 2001
US $75.00 Add to Cart
Description
Table of Contents
Author Information
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 L1 penalty function. Contents Part 1 Unconstrained Optimization Part 2 Constrained Optimization
  1. Introduction
  2. Structure of Methods
  3. Newton-like Methods
  4. Conjugate Direction Methods
  5. Restricted Step Methods
  6. Sums of Squares and Nonlinear Equations
  7. Introduction
  8. Linear Programming
  9. The Theory of Constrained Optimization
  10. Quadratic Programming
  11. General Linearly Constrained Optimization
  12. Nonlinear Programming
  13. Other Optimization Problems

Printer-ready versionE-mail a friend