Nonlinear Programming: Theory and Algorithms - Bazaraa, Mokhtar S.; Sherali, Hanif D.; Shetty, C. M. (New York John Wiley & Sons, Inc., 2004)
Chapter - 1: Introduction Part - 1: Convex Analysis Chapter - 2: Convex Sets Chapter - 3: Convex Functions and Generalizations Part - 2: Optimality Conditions and Duality Chapter - 4: the Fritz and the Karush Kuhn Tucker Optimality Chapter - 5: Constraint Qualifications Chapter - 6: Lagrangian Duality and Saddle Point Optimality Conditions Part - 3: Algorithms and Their Convergence Chapter - 7: The Concept of an Algorithm Chapter - 8: Unconstrained Optimization Chapter - 9: Penalty and Barrier Functions Chapter - 10: Methods of Feasible Directions Chapter - 11: Linear Complementary Problem and Quadratic, Separable, Fractional and Geometric Programming Appendix - A: Mathematical Review Appendix - B: Summary of Convexity, Optimality Conditions and Duality
Keywords: Mathematics