Comprehensive and complete, this overview provides a single-volume treatment of key algorithms and theories. The author provides clear explanations of all theoretical aspects, with rigorous proof of most results. The two-part treatment begins with the derivation of optimality conditions and discussions of convex programming, duality, generalized convexity, and analysis of selected nonlinear programs. The second part concerns techniques for numerical solutions and unconstrained optimization methods, and it presents commonly used algorithms for constrained nonlinear optimization problems. This graduate-level text requires no advanced mathematical background beyond elementary calculus, linear algebra, and real analysis. 1976 edition. 58 figures. 7 tables.
Unabridged republication of the edition published by Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1976.
|Availability||Usually ships in 24 to 48 hours|
|Dimensions||5 3/8 x 8 1/2|