Nonlinear Programming: Analysis and Methods

This overview of nonlinear programming provides a single-volume treatment of key algorithms and theories that forms an excellent bridge between principal theories and concepts and their practical limplementation. The two-part treatment begins with the derivation of optimality conditions and discussions of convex programming, duality generalized convexity, and anlysis 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. Topics include, among others, conjugate functio theory, dualsiyty in nonlinear programming, and parallel methods of optimization. References, Author Index, Subject Index. 512p.