实用最优化方法中的英文单词和短语.docx

实用最优化方法中的英文单词和短语实用最优化方法Practical Methods of Optimization第一章 预备知识Chapter 1 Preliminary目标函数objective function决策变量（设计变量）decision condition限制条件（约束条件）constrained condition受约束于s. t. / subject to线性规划linear programming非线性规划nonlinear programming多目标线性规划multi-objective linear programming间接最优化（解析最优化）indirectly optimal method直接最优化（试验最优化）directly optimal method可行集（容许集）feasible set可行解（容许解）feasible solution全局极小点global minimizer严格全局极小点 strict global minimizer局部极小点local minimizer稳定点（驻点）stationary point图解法graphical approach二次规划quadratic programming整数规划integer programming几何规划geometric programming多项式polynomial正定多项式positive definite polynomial正项几何规划positive geometric programming符号几何规划symbol geometric programming多目标规划multi-object programming第二章 线性规划Chapter 2 Linear Programming松弛变量slack variable自由变量free variable约束方程constrained equation维数dimension阶数order可行点（可行解，容许解）feasible point基（基底）basis基本解basic solution基本变量basic variable退化degeneration基本可行解basic feasible solution正闭半空间positive close half space多面凸集polyhedral convex sets多面凸体（凸多面体）convex polyhedron有限最优解finite optimal solution摄动法perturbation method字典序法lexicographic method布兰德法Bland method枚举法enumeration method规范criterion相对成本系数（检验数或判别数）relatively cost coefficient主元素pivot element高斯消元（旋转）Gauss elimination检验数inspection number人工变量artificial variable二阶段法two-stage method相对成本矢量（检验矢量）check vector修正单纯形法revised simplex method对偶理论duality theory对偶单纯形法dual simplex method原始规划问题original programming problem对偶规划问题dual programming problem对偶可行解（正则解）dual feasible solution不可行解infeasibility椭球算法ellipsoid algorithm多项式时间算法（多项式算法）polyhedral algorithm计算复杂性computation complexity指数型算法exponential algorithm第三章 无约束优化算法Chapter 3 Unconstraint Programming下降递推算法（下降算法）descent algorithm无约束优化unconstrained optimization步长step length初始点starting搜索方向search direction一维搜索（线搜索）linear search等比序列（几何序列）equal-ratio series计算精度（终止限）accuracy of computation精确一维搜索precise linear search抛物线法parabola algorithm三次插值法cubic interpolation牛顿法Newton method拟牛顿法quasi-Newton method插值多项式interpolation polynomial插值条件interpolation condition平分法（对分法）bisection method黄金分割法（0.618法）golden section method搜索区间search interval二次插值法quadratic interpolation下降方向descent direction水平集level set稳定点stationary point尺度scale扰动disturbance修正牛顿法modified Newton method黑塞矩阵Hessian matrix共轭梯度法conjugate gradient algorithmA-共轭a-conjugation左乘left multiplication正定矩阵positive definite matrix右乘right multiplication严格凸函数strict convex function待定系数undetermined coefficientF-R共轭梯度法F-R conjugate gradient algorithm变尺度法variable metric method对称秩1算法symmetric rank 1 algorithm纯量scalar自调节变尺度算法类self-scaling variable metric algorithm class探测搜索detective search步长加速法（模式搜索法）step acceleration algorithm加速因子acceleration factor反射reflection压缩（收缩）contraction扩张（延伸）expansion鲍威尔方法Powell method第四章 约束优化算法Chapter 4 Constrained ProgrammingSUMT外点法（惩罚函数法）SUMT exterior point algorithmSUMT内点法（碰壁函数法）SUMT interior point algorithm乘子法multiplier method可行方向法feasible direction method梯度投影法gradient project algorithm既约梯度法reduced gradient algorithm复形法complex method随机试验法random experiment method起作用约束effective constrain互补松弛条件complementary slackness condition伪凸pseudo-convex拟凸quasi-convex拟凹quasi-concave惩罚函数penalty factor惩罚项penalty term临界点critical point健集robust set范数norm混合罚函数法mixed penalty function method投影矩阵projected matrix改进方向improve direction指标集index set可行方向锥feasible direction cone线搜索linear search迭代方向iterative direction病态ill-condition梯度gradient线性逼近法（序列线性规划法）linear approximation method二次逼近法（序列二次规划法）quadratic approximation method不相容inconsistent有效约束efficient constrain有效集efficient set严格整体解strictly global solution二次规划子问题quadratic programming subproblem第五章 多目标规划Chapter 5 Multi-Object Programming可行集（约束集）feasible set可行解（容许解）feasible solution绝对最优解absolute optimal solution有效解（Pareto解、非劣解）efficient solution弱有效解（弱Pareto解）weak efficient solution映射map像集image set原像pre-image有效点efficient point弱有效点weak efficient point分层序列法lexicographical order criteria评价函数法evaluation function method理想点法idealized pattern method平方和加权法square sum weighted method线性加权和法linear weighted sum method逐步法step method第六章 整数规划Chapter 6 Integer Programming整数线性规划integer linear programming混合型整数规划mixed integer programming纯整数规划pure integer programming割平面算法cut-plane algorithm分支界定算法branch-bounded algorithm隐枚举法implicit enumeration method匈牙利法Hungarian method群论方法group method诱导方程derivational equation完全枚举法(穷举法)method of exhaustion试探解法trial method指派问题assignment problem系数矩阵coefficient matrix费用矩阵charge matrix成本矩阵cost matrix时间矩阵time matrix无后效性（马尔可夫性）Markov property人工神经网络artificial neural network第七章 动态规划Chapter 7 Dynamic Programming动态规划dynamic programming决策序列decision sequence策略strategy阶段变量phase variable状态变量state variable子过程策略（子策略）quantum strategy状态转移方程transformation equation阶段目标函数phase object function过程目标函数process object function最优策略optimum policy最优值optimal value标号法noted-method泛函方程functional equation定期多阶段决策问题problem of regular multistage decision递推方法recursive construction method距离矩阵distance matrix逆序递推发inverse order recursion顺序递推发order recursion多阶段配置multistage collocated第八章 进化算法Chapter 8 Evolutionary Algorithm进化计算evolutionary computation进化算法evolutionary algorithm进化策略evolutionary strategy进化规划evolutionary programming遗传算法genetic algorithm鲁棒性robustness并行计算parallel problem自适应adaptive自适应机器学习法adaptive machine study method模式定理schema theorem多点迭代算法multipoint iteration algorithm单点迭代算法point iteration algorithm依概率收敛converg