Кузнецова О.С., Ханаев В.В. Альтернативные возможности использования электрокаров в Сибири // Школа молодых ученых "Приоритеты научно-технологического развития энергетики России". Москва, ИНЭИ РАН Россия. 10 - 11 ноября 2021 г. 2021. Статья конференции
Теги: branch-and-bound method , global optimization , parallel computing , quadratic programming , np-hard , approximate solution , computational comparisons , convex approximation , minimization problems , nonconvex quadratic programs , objective functions , partition seZorkaltsev V.I., Mokryi I.V. Interior Point Algorithms in Linear Optimization // Journal of Applied and Industrial Mathematics. Vol.12. No.1. 2018. P.191-199. DOI: 10.1134/S1990478918010179 This is a survey of the results concerning the development and study of the interior point algorithms. Some families of the direct and dual algorithms are considered. These algorithms entering the domain of feasible solutions take into account the objective function, which makes it possible to obtain the first...
Теги: central path , interior point method , linear programming , relative interior , energy engineering , interior point algorithm , interior-point method , linear optimization , objective functions , optimal solutions , polynomial optimization , optimizatio... subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.10556 LNCS. 2017. P.338-344. ISBN (print): 9783319694030. DOI: 10.1007/978-3-319-69404-7_28 In this paper we consider global optimization problems in which objective functions are explicitly given and can be represented as compositions of some other functions. We discuss an approach of reducing the complexity of the objective by introducing new variables and adding new constraints. © Springer International ...
Теги: d.c. function , decomposition , global optimization , induced constraint , optimization , global optimization problems , objective functions
