Titlebook: Non-Convex Multi-Objective Optimization; Panos M. Pardalos,Antanas Žilinskas,Julius Žilinsk Book Aug 20171st edition Springer Internationa

Frequency

Worst-Case Optimal Algorithmsl algorithms are constructed for the cases of passive (non-adaptive) and sequential (adaptive) search in [.]. These results are the generalization to the multi-objective case of the results by Sukharev who investigated the worst-case optimal single-objective optimization algorithms in [., .].

鞭打

斗争

nuclear-tests

Approximation and Complexitycomplexity theories have been developed for the investigation of problems of continuous nature. For the fundamentals of the complexity of real number algorithms we refer to [., .], and for the complexity of problems of mathematical programming to [., ., .].

不开心

Statistical Models Based Algorithmsmization point of view, properties of . as non-differentiability, non-convexity, and multimodality cannot be excluded. Difficulties of the black-box global optimization of expensive functions are well known from the experience gained in the single-objective case.

明智的人

毛细血管

Multi-Objective Branch and Boundpresents an unexplored subset of feasible decisions. The iteration has three main components: selection of the subset to be processed, branching corresponding to subdivision of the subset, and bound calculation.

Congruous

砍伐