Includes bibliographical references (p. 779-841) and index
Convex sets -- Convex functions and generalizations -- The Fritz John and Karush-Kuhn-Tucker optimality conditions -- Constraint qualifications -- Lagrangian duality and saddle point optimality conditions -- The concept of an algorithm -- Unconstrained optimization -- Penalty and barrier functions -- Methods of feasible directions -- Linear complementary problem, and quadratic, separable, fractional, and geometric programming.
