PROBLEM-METHOD CLASSIFICATION IN OPTIMIZATION AND CONTROL

被引:6
作者
GALPERIN, EA
机构
[1] Département de Mathématiques et d'Informatique, Université du Québec à Montréal C.P. 8888, Succ. A, Montréal, Qué.
关键词
D O I
10.1016/0898-1221(91)90155-W
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
There are many classifications in optimization and control (continuous, discrete, integer problems; convex or concave minimization; steepest descent, branch and bound, path following, space filling, random search methods; smooth or non smooth problems; etc.). The aim of this short note is not to propose yet another classification, but to clarify existing ambiguities and imprecisions in problem formulations and to emphasize certain fundamental distinctions in solution methods currently used.
引用
收藏
页码:1 / 6
页数:6
相关论文
共 30 条