On Subgradient Methods with Polyak’s Step and Space Transformation

V. Stovba, O.O. Zhmud
{"title":"On Subgradient Methods with Polyak’s Step and Space Transformation","authors":"V. Stovba, O.O. Zhmud","doi":"10.34229/2707-451x.22.4.4","DOIUrl":null,"url":null,"abstract":"Introduction. Minimization of ravine convex functions, both smooth and non-smooth, arises in many problems of planning, control, stability analysis of dynamic systems, artificial intelligence, and machine learning. Therefore, the development of new and improvement of existing methods is an important task, taking into account the fact that more and more frequently the functions to be minimized depend on a large number of variables.\nSpecial attention should be paid to the methods using the operation of linear transformation of space, which allow to improve the properties of the objective function and significantly accelerate its minimization. Known methods of this type, in particular, ellipsoid methods and r-algorithms, require recalculation of the transformation matrix at each iteration. Therefore, the development of methods with a one-time transformation of space, which have a lower cost of iteration, is definitely an urgent task.\nThe purpose of the article is to review modifications of subgradient method with Polyak’s step that use a scalar parameter m(1 and one-time space transformation operation. Supplement the justification of the convergence and convergence rate of the modifications described. Give recommendations regarding determination of parameter m and space transformation matrix B.\nResults. Subgradient method with Polyak’s step in transformed space and parameter m>1 is an effective method for minimizing smooth and non-smooth convex functions that have a ravine structure. Determination of an appropriate value of the parameter m(1 and space transformation matrix B allows to significantly accelerate this method and use it for minimization functions that depend on a large number of variables.\nConclusions. The development of fast methods for minimization of non-smooth convex functions of many variables with a ravine structure makes it possible to effectively solve modern problems of artificial intelligence, in particular, the problems of machine learning, image recognition, big data analysis, etc. Keywords: subgradient method, space transformation, ravine functions.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kibernetika ta kompiuterni tekhnologiyi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34229/2707-451x.22.4.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Introduction. Minimization of ravine convex functions, both smooth and non-smooth, arises in many problems of planning, control, stability analysis of dynamic systems, artificial intelligence, and machine learning. Therefore, the development of new and improvement of existing methods is an important task, taking into account the fact that more and more frequently the functions to be minimized depend on a large number of variables. Special attention should be paid to the methods using the operation of linear transformation of space, which allow to improve the properties of the objective function and significantly accelerate its minimization. Known methods of this type, in particular, ellipsoid methods and r-algorithms, require recalculation of the transformation matrix at each iteration. Therefore, the development of methods with a one-time transformation of space, which have a lower cost of iteration, is definitely an urgent task. The purpose of the article is to review modifications of subgradient method with Polyak’s step that use a scalar parameter m(1 and one-time space transformation operation. Supplement the justification of the convergence and convergence rate of the modifications described. Give recommendations regarding determination of parameter m and space transformation matrix B. Results. Subgradient method with Polyak’s step in transformed space and parameter m>1 is an effective method for minimizing smooth and non-smooth convex functions that have a ravine structure. Determination of an appropriate value of the parameter m(1 and space transformation matrix B allows to significantly accelerate this method and use it for minimization functions that depend on a large number of variables. Conclusions. The development of fast methods for minimization of non-smooth convex functions of many variables with a ravine structure makes it possible to effectively solve modern problems of artificial intelligence, in particular, the problems of machine learning, image recognition, big data analysis, etc. Keywords: subgradient method, space transformation, ravine functions.
关于Polyak阶跃变换和空间变换的次梯度法
介绍。在规划、控制、动态系统稳定性分析、人工智能和机器学习的许多问题中,都会出现光滑和非光滑沟壑凸函数的最小化问题。因此,考虑到要最小化的函数越来越频繁地依赖于大量变量,开发新的和改进现有的方法是一项重要的任务。需要特别注意的是使用空间线性变换运算的方法,它可以改善目标函数的性质,并显著加快其最小化。已知的这类方法,特别是椭球法和r-算法,每次迭代都需要重新计算变换矩阵。因此,开发迭代成本更低的一次性空间变换方法无疑是一项紧迫的任务。本文的目的是回顾使用标量参数m(1)和一次性空间变换操作的Polyak步骤对次梯度法的修正。补充所描述的修改的收敛性和收敛率的理由。对参数m和空间变换矩阵b的确定提出建议。变换空间中的Polyak步长和参数为m>1的子梯度法是求解具有沟壑结构的光滑和非光滑凸函数的有效方法。确定参数m(1)和空间变换矩阵B的适当值,可以显著加快该方法的速度,并将其用于依赖于大量变量的最小化函数。具有沟壑结构的多变量非光滑凸函数的快速最小化方法的发展,使得有效解决现代人工智能问题,特别是机器学习、图像识别、大数据分析等问题成为可能。关键词:次梯度法,空间变换,峡谷函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
20
审稿时长
6 weeks
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书