{"title":"Preface to the special issue","authors":"O. Khamisov, A. Eremeev, Vladimir Ushakov","doi":"10.1080/10556788.2021.2061218","DOIUrl":null,"url":null,"abstract":"This Special Issue of Optimization Methods and Software is devoted to the International Conference ‘Mathematical Optimization Theory and Operations Research’ (MOTOR 2019), held near Ekaterinburg city, Russia, on 8–12 July 2019. The conferences of MOTOR series are descendants of four well-known international and all-Russian conferences, which were held in Ural, Siberia, and the Far East for several decades. The talks presented at these conferences are frequently published in several special issues of well-known journals. To fulfil the standard number of pages per issue, some regular papers were added to this journal issue after the following three papers were originally submitted to the special issue. The paper ‘Cooperative Differential Games with Continuous Updating Using Hamil-ton–Jacobi–Bellman equation‘ by O. Petrosian, A. Tur, Z. Wang, H. Gao investigates cooperative differential games with structures defined for a closed time interval with a fixed duration. The problem of cooperative players’ behaviour is considered. This paper contains a very nice introduction and theoretical results as well as an illustrative example with a model of non-renewable resource extraction. Dynamic Programming for Travelling Salesman with Precedence Constraints: Parallel Morin–Marsten bounding’ implement a parallel Morin–Marsten Branch-and-Bound Scheme for Dynamic Programming and test it on conventional and bottleneck formulations of the Travelling Salesman with Precedence Constraints, using the benchmark instances from TSPLIB. In the experiment, the parallel scheme to scale well with the number of processors and showed significant memory savings, compared to the non-bounded dynamic programming, especially on the large-scale instances. Variational and methods for solving optimization problems, saddle point problems and variational inequalities are proposed. Smooth and nonsmooth cases are considered. This paper provides sufficient theoretical justification and quite comprehensive numerical testing results.","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Methods and Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10556788.2021.2061218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This Special Issue of Optimization Methods and Software is devoted to the International Conference ‘Mathematical Optimization Theory and Operations Research’ (MOTOR 2019), held near Ekaterinburg city, Russia, on 8–12 July 2019. The conferences of MOTOR series are descendants of four well-known international and all-Russian conferences, which were held in Ural, Siberia, and the Far East for several decades. The talks presented at these conferences are frequently published in several special issues of well-known journals. To fulfil the standard number of pages per issue, some regular papers were added to this journal issue after the following three papers were originally submitted to the special issue. The paper ‘Cooperative Differential Games with Continuous Updating Using Hamil-ton–Jacobi–Bellman equation‘ by O. Petrosian, A. Tur, Z. Wang, H. Gao investigates cooperative differential games with structures defined for a closed time interval with a fixed duration. The problem of cooperative players’ behaviour is considered. This paper contains a very nice introduction and theoretical results as well as an illustrative example with a model of non-renewable resource extraction. Dynamic Programming for Travelling Salesman with Precedence Constraints: Parallel Morin–Marsten bounding’ implement a parallel Morin–Marsten Branch-and-Bound Scheme for Dynamic Programming and test it on conventional and bottleneck formulations of the Travelling Salesman with Precedence Constraints, using the benchmark instances from TSPLIB. In the experiment, the parallel scheme to scale well with the number of processors and showed significant memory savings, compared to the non-bounded dynamic programming, especially on the large-scale instances. Variational and methods for solving optimization problems, saddle point problems and variational inequalities are proposed. Smooth and nonsmooth cases are considered. This paper provides sufficient theoretical justification and quite comprehensive numerical testing results.
本期《优化方法与软件》特刊致力于2019年7月8日至12日在俄罗斯叶卡捷琳堡市附近举行的“数学优化理论与运筹学”国际会议(MOTOR 2019)。MOTOR系列会议是在乌拉尔、西伯利亚和远东地区举办了几十年的四次著名的国际和全俄会议的后裔。在这些会议上的演讲经常发表在一些知名期刊的特刊上。为了达到每期的标准页数,在以下三篇论文最初提交到特刊之后,在这一期期刊中增加了一些普通论文。O. Petrosian, a . Tur, Z. Wang, H. Gao的论文“使用hamilton -ton - jacobi - bellman方程的连续更新的合作微分对策”研究了具有固定持续时间的封闭时间区间结构的合作微分对策。考虑了合作参与者的行为问题。本文包含了一个很好的介绍和理论结果,以及一个具有不可再生资源开采模型的说明性实例。具有优先约束的旅行商动态规划:并行Morin-Marsten边界实现了一种动态规划的并行Morin-Marsten分支定界方案,并利用TSPLIB的基准实例在具有优先约束的旅行商的常规公式和瓶颈公式上进行了测试。在实验中,与无界动态规划相比,并行方案可以很好地随处理器数量的增加而扩展,并显示出显著的内存节省,特别是在大规模实例上。提出了求解优化问题、鞍点问题和变分不等式的变分方法。考虑了光滑和非光滑情况。本文提供了充分的理论依据和较为全面的数值试验结果。