MULTI-BLOCK ADMM METHOD WITH NESTEROV ACCELERATION

Q3 Engineering
Vladislav Hrygorenko, D. Klyushin, S. Lyashko
{"title":"MULTI-BLOCK ADMM METHOD WITH NESTEROV ACCELERATION","authors":"Vladislav Hrygorenko, D. Klyushin, S. Lyashko","doi":"10.34229/1028-0979-2021-4-1","DOIUrl":null,"url":null,"abstract":"ADMM (alternating direction methods of multipliers) is widely used to solve many optimization problems. This method is especially important for solving problems arising in great variety of fields, especially in machine learning, mathematical statistics and pattern recognition, signal denoising and big data analysis using parallel computations. ADMM also useful for solving optimization problems in cases when objective function presented as sum of smooth and non-smooth functions. Standard two block ADMM can be extended for solving problems where objective function can be represented as sum of N functions (multiblock approach). In this paper we described some most common used technics used for acceleration of ADMM and reviewed most significant works related to this topic. The aim of this paper is to develop an improved version of the ADMM with better convergence rate. For this, we used a combination of two already existing approaches: splitting the initial optimization problem into subtasks and solving them in parallel using multiblock approach and calculating the Nesterov acceleration at each iteration step. We provided a theoretical justification for the convergence of this method, defined necessary for convergence conditions, and also implemented the proposed algorithm in the Python programming language and applied it to solve the problem of exchange with random data, basis pursuit problem and LASSO with restrictions problem. The article presents the results of comparing the effectiveness of the multiblock ADMM method with Nesterov acceleration and the existing multiblock and standard two-block ADMM method. Multiblock ADMM with Nesterov acceleration demonstrates better performance that already existing methods and also can be easily adopted for parallel calculation. Proposed method has great practical value due to necessity to solve optimization problems with great volumes of data, which requires high performance, because it works much more faster than well-known analogies. The use of the proposed method will make it possible to solve practically important problems of large volume using parallel calculations.","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Automation and Information Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34229/1028-0979-2021-4-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

ADMM (alternating direction methods of multipliers) is widely used to solve many optimization problems. This method is especially important for solving problems arising in great variety of fields, especially in machine learning, mathematical statistics and pattern recognition, signal denoising and big data analysis using parallel computations. ADMM also useful for solving optimization problems in cases when objective function presented as sum of smooth and non-smooth functions. Standard two block ADMM can be extended for solving problems where objective function can be represented as sum of N functions (multiblock approach). In this paper we described some most common used technics used for acceleration of ADMM and reviewed most significant works related to this topic. The aim of this paper is to develop an improved version of the ADMM with better convergence rate. For this, we used a combination of two already existing approaches: splitting the initial optimization problem into subtasks and solving them in parallel using multiblock approach and calculating the Nesterov acceleration at each iteration step. We provided a theoretical justification for the convergence of this method, defined necessary for convergence conditions, and also implemented the proposed algorithm in the Python programming language and applied it to solve the problem of exchange with random data, basis pursuit problem and LASSO with restrictions problem. The article presents the results of comparing the effectiveness of the multiblock ADMM method with Nesterov acceleration and the existing multiblock and standard two-block ADMM method. Multiblock ADMM with Nesterov acceleration demonstrates better performance that already existing methods and also can be easily adopted for parallel calculation. Proposed method has great practical value due to necessity to solve optimization problems with great volumes of data, which requires high performance, because it works much more faster than well-known analogies. The use of the proposed method will make it possible to solve practically important problems of large volume using parallel calculations.
具有nesterov加速的多块admm方法
乘法器的交替方向法(ADMM)被广泛用于解决许多优化问题。这种方法对于解决各种领域中出现的问题尤其重要,特别是在机器学习、数理统计和模式识别、信号去噪和使用并行计算的大数据分析中。当目标函数为光滑函数和非光滑函数的和时,ADMM也可用于解决优化问题。标准的两分块ADMM可以扩展为解决目标函数可以表示为N个函数的和的问题(多分块方法)。在本文中,我们描述了一些最常用的用于加速ADMM的技术,并回顾了与该主题相关的最重要的工作。本文的目的是开发一种具有更好收敛速度的改进版ADMM。为此,我们使用了两种现有方法的组合:将初始优化问题分解为子任务,并使用多块方法并行解决它们,并在每个迭代步骤计算Nesterov加速度。给出了该方法收敛性的理论证明,定义了收敛的必要条件,并在Python编程语言中实现了该算法,并将其应用于解决随机数据交换问题、基寻址问题和带约束的LASSO问题。本文给出了采用Nesterov加速的多块ADMM方法与现有多块ADMM方法和标准双块ADMM方法的有效性比较结果。具有Nesterov加速的多块ADMM具有比现有方法更好的性能,并且易于用于并行计算。由于该方法需要解决具有大量数据的优化问题,这对性能要求很高,因此具有很大的实用价值,因为它比已知的类比更快。该方法的应用将使利用并行计算解决大体积的实际重要问题成为可能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Automation and Information Sciences
Journal of Automation and Information Sciences AUTOMATION & CONTROL SYSTEMS-
自引率
0.00%
发文量
0
审稿时长
6-12 weeks
期刊介绍: This journal contains translations of papers from the Russian-language bimonthly "Mezhdunarodnyi nauchno-tekhnicheskiy zhurnal "Problemy upravleniya i informatiki". Subjects covered include information sciences such as pattern recognition, forecasting, identification and evaluation of complex systems, information security, fault diagnosis and reliability. In addition, the journal also deals with such automation subjects as adaptive, stochastic and optimal control, control and identification under uncertainty, robotics, and applications of user-friendly computers in management of economic, industrial, biological, and medical systems. The Journal of Automation and Information Sciences will appeal to professionals in control systems, communications, computers, engineering in biology and medicine, instrumentation and measurement, and those interested in the social implications of technology.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信