An introduction to optimization
Author(s)
Bibliographic Information
An introduction to optimization
（Wiley-Interscience series in discrete mathematics and optimization）
Wiley, c1996
Available at 37 libraries
Note
Includes bibliographical references (p. 396-399) and index
Description and Table of Contents
Description
This introduction to optimization methods and theory is aimed at the senior undergraduate and beginning graduate. Supplemented with worked examples to illustrate both theory and algorithms, it describes such topics as unconstrained optimization, linear programming and constrained optimization.
Table of Contents
- Partial table of contents:
- MATHEMATICAL REVIEW
- Methods of Proof and Some Notation
- Real Vector Spaces and Matrices
- Transformations
- Concepts from Geometry
- UNCONSTRAINED OPTIMIZATION
- One-Dimensional Search Methods
- Gradient Methods
- Newton's Method
- Conjugate Direction Methods
- Quasi-Newton Methods
- Genetic Algorithms
- LINEAR PROGRAMMING
- Introduction to Linear Programming
- The Simplex Method
- Duality
- Non-Simplex Methods
- NONLINEAR CONSTRAINED OPTIMIZATION
- Problems with Inequality Constraints
- Convex Optimization Problems
- Bibliography
- Index.
by "Nielsen BookData"