优化设计
1.1Traditional design and optimization design advantages and disadvantages respectively have?
2.Standard mathematical model for optimal design______。
3.Optimization design iteration formula is______。
2.1 Directional derivative formula is______。
Directional derivative formula expressed in gradient______。
2.Gradient formula is______。
3.Taylor expansion is______。
4.Hessian matrix is______。
5.The necessary condition of extreme value is______。
The sufficient condition of extreme value is______。
6.Extreme value with x * said,extremum point of function f (x*) said。
grange function expression is______。
8.Convex function of local optimal solution is global optimal solution（）
9.Kuhn tucker condition______。
3.2 Iterative formula of golden section method is______。
2.1Golden section method of iteration termination criterion is______。
4.1 Quadratic function is expressed in matrix form______。
1.2the gradient of it is______。
2.Iterative formula of the steepest descent method is______。
The steepest descent method of iteration termination criteria______。
3.If Newton's method of quadratic convergence（）
4.Newton's method of iteration formula is______。
Newton's method of iteration termination criterion______。
5.Newton's method is damped Newton method take 1 damping factor。
6.Quadrature is a special case of the conjugate when ______。
7.If the conjugate direction method of quadratic convergence（）
10.Variable metric method of quasi Newton condition is______。
11.Powell search direction______。
12.Simple substitution method of simplex what to get______。
6.1 There are several kinds of punishment function?______。
2.Discrete variable optimization problems as a continuous variable optimization problem to solve, extreme value point must be rounded.
计算题（提问的方式大概就这个样子）
1.By using the golden section method to solve the following function of the minimum and the minimum point.（用黄金分割法求解下列函数的极小值和极小点。
）
ing the steepest descent method to solve the following function of minimum and the minimum point.（用最速下降法求解下列函数的极小值和极小点。
）
ing conjugate gradient method to solve the minimum and the minimum point of the following functions.（用共轭梯度法求解下列函数的极小值和极小点。
）
1.Interpolation method compared with heuristics, is to use the functions in the value of the known points or derivative value to determine the location of the new sites（插值法比起试探法，是利用函数在已知点的值或导数值来确定新试验点的位置x）
2.Band elimination reverse search step size h > 0(区间消去法反向搜索的步长h>0)
3.Variable metric method is a general quadratic function in order to reduce the scale of the transformation to the eccentricity of the second order items(变尺度法的尺度变换是为了减小一般二次函数二次项的偏心程度)
4.A given search interval(给定搜索区间)。