优化与运筹概念 Optimization & Operations Research Concepts
目标约束建模、最优性与求解方法。
父分类1
实例 27
- 分支定界Branch and Bound
- 组合优化Combinatorial Optimization
- 约束规划Constraint Programming
- 凸函数Convex Function
- 凸优化Convex Optimization
- 凸集Convex Set
- 坐标下降Coordinate Descent
- 可行域Feasible Region
- 梯度下降Gradient Descent
- 整数规划Integer Programming
- 内点法Interior-Point Method
- KKT 条件Karush–Kuhn–Tucker Conditions
- 拉格朗日对偶Lagrange Duality
- 拉格朗日函数Lagrangian
- 线性规划Linear Programming
- 数学优化Mathematical Optimization
- 混合整数规划Mixed-Integer Programming
- 牛顿法Newton's Method
- 非线性规划Nonlinear Programming
- 运筹学Operations Research
- 优化问题Optimization Problem
- 优化求解器Optimization Solver
- 二次规划Quadratic Programming
- 拟牛顿法Quasi-Newton Method
- 半正定规划Semidefinite Programming
- 单纯形法Simplex Method
- 随机梯度下降Stochastic Gradient Descent