全面而完整，本概述提供了密钥算法和理论的单卷处理。笔者提供所有理论方面的明确解释，与大多数结果严格的证明。这两个部分的处理开始的优选条件和凸规划，对偶，广义凸性的讨论，并选定非线性规划分析推导。第二部份是有关技术和数值解无约束优化方法，并介绍了常用的约束非线性优化问题的算法。本次毕业级文本不需要超出初等微积分，线性代数，高等数学和现实背景分析。

-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.