具有非凸非光滑项的非凸线性最小问题的近似近似梯度算法

IF 16.4 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY

Accounts of Chemical Research Pub Date : 2024-03-25 DOI:10.1007/s10898-024-01383-3

Jiefei He, Huiling Zhang, Zi Xu

{"title":"具有非凸非光滑项的非凸线性最小问题的近似近似梯度算法","authors":"Jiefei He, Huiling Zhang, Zi Xu","doi":"10.1007/s10898-024-01383-3","DOIUrl":null,"url":null,"abstract":"Nonconvex minimax problems have attracted significant attention in machine learning, wireless communication and many other fields. In this paper, we propose an efficient approximation proximal gradient algorithm for solving a class of nonsmooth nonconvex-linear minimax problems with a nonconvex nonsmooth term, and the number of iteration to find an \\(\\varepsilon \\)-stationary point is upper bounded by \\({\\mathcal {O}}(\\varepsilon ^{-3})\\). Some numerical results on one-bit precoding problem in massive MIMO system and a distributed non-convex optimization problem demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms\",\"authors\":\"Jiefei He, Huiling Zhang, Zi Xu\",\"doi\":\"10.1007/s10898-024-01383-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nonconvex minimax problems have attracted significant attention in machine learning, wireless communication and many other fields. In this paper, we propose an efficient approximation proximal gradient algorithm for solving a class of nonsmooth nonconvex-linear minimax problems with a nonconvex nonsmooth term, and the number of iteration to find an \\\\(\\\\varepsilon \\\\)-stationary point is upper bounded by \\\\({\\\\mathcal {O}}(\\\\varepsilon ^{-3})\\\\). Some numerical results on one-bit precoding problem in massive MIMO system and a distributed non-convex optimization problem demonstrate the effectiveness of the proposed algorithm.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2024-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10898-024-01383-3\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10898-024-01383-3","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

非凸最小问题在机器学习、无线通信和许多其他领域引起了极大关注。本文提出了一种高效的近似梯度算法，用于求解一类带有非凸非光滑项的非凸线性 minimax 问题，且找到 \(\varepsilon \)-驻点的迭代次数上界为\({\mathcal {O}}(\varepsilon ^{-3})\)。在大规模 MIMO 系统中的单比特预编码问题和分布式非凸优化问题上的一些数值结果证明了所提算法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms

查看原文本刊更多论文

An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms

Nonconvex minimax problems have attracted significant attention in machine learning, wireless communication and many other fields. In this paper, we propose an efficient approximation proximal gradient algorithm for solving a class of nonsmooth nonconvex-linear minimax problems with a nonconvex nonsmooth term, and the number of iteration to find an \(\varepsilon \)-stationary point is upper bounded by \({\mathcal {O}}(\varepsilon ^{-3})\). Some numerical results on one-bit precoding problem in massive MIMO system and a distributed non-convex optimization problem demonstrate the effectiveness of the proposed algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Accounts of Chemical Research 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.