• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种加速近端增广拉格朗日方法及其在压缩感知中的应用。

An accelerated proximal augmented Lagrangian method and its application in compressive sensing.

作者信息

Sun Min, Liu Jing

机构信息

School of Management, Qufu Normal University, Shandong, 276826 P.R. China.

School of Mathematics and Statistics, Zaozhuang University, Shandong, 277160 P.R. China.

出版信息

J Inequal Appl. 2017;2017(1):263. doi: 10.1186/s13660-017-1539-0. Epub 2017 Oct 23.

DOI:10.1186/s13660-017-1539-0
PMID:29104401
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC5651725/
Abstract

As a first-order method, the augmented Lagrangian method (ALM) is a benchmark solver for linearly constrained convex programming, and in practice some semi-definite proximal terms are often added to its primal variable's subproblem to make it more implementable. In this paper, we propose an accelerated PALM with indefinite proximal regularization (PALM-IPR) for convex programming with linear constraints, which generalizes the proximal terms from semi-definite to indefinite. Under mild assumptions, we establish the worst-case [Formula: see text] convergence rate of PALM-IPR in a non-ergodic sense. Finally, numerical results show that our new method is feasible and efficient for solving compressive sensing.

摘要

作为一种一阶方法,增广拉格朗日方法(ALM)是线性约束凸规划的基准求解器,并且在实际中,一些半定近端项经常被添加到其原始变量的子问题中以使其更易于实现。在本文中,我们针对线性约束凸规划提出了一种具有不定近端正则化的加速PALM(PALM-IPR),它将近端项从半定推广到不定。在温和假设下,我们建立了PALM-IPR在非遍历意义下的最坏情况[公式:见正文]收敛速率。最后,数值结果表明我们的新方法对于求解压缩感知是可行且有效的。

相似文献

1
An accelerated proximal augmented Lagrangian method and its application in compressive sensing.一种加速近端增广拉格朗日方法及其在压缩感知中的应用。
J Inequal Appl. 2017;2017(1):263. doi: 10.1186/s13660-017-1539-0. Epub 2017 Oct 23.
2
The symmetric ADMM with indefinite proximal regularization and its application.具有不定近端正则化的对称交替方向乘子法及其应用。
J Inequal Appl. 2017;2017(1):172. doi: 10.1186/s13660-017-1447-3. Epub 2017 Jul 21.
3
The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization.具有不定近端正则化的近端交替方向乘子法的收敛速度
J Inequal Appl. 2017;2017(1):19. doi: 10.1186/s13660-017-1295-1. Epub 2017 Jan 14.
4
Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming.用于三模块可分凸规划的具有更大步长的增广拉格朗日方法的改进混合分解
J Inequal Appl. 2018;2018(1):269. doi: 10.1186/s13660-018-1863-z. Epub 2018 Oct 4.
5
An accelerated proximal gradient algorithm for singly linearly constrained quadratic programs with box constraints.一种用于具有盒约束的单线性约束二次规划的加速近端梯度算法。
ScientificWorldJournal. 2013 Oct 7;2013:246596. doi: 10.1155/2013/246596. eCollection 2013.
6
A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming.用于两模块可分凸规划的乘子交替方向法的对称形式。
J Inequal Appl. 2017;2017(1):129. doi: 10.1186/s13660-017-1405-0. Epub 2017 Jun 5.
7
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates.在凸域中具有迭代收敛保证的快速增广拉格朗日方法。
Math Program. 2023;200(1):147-197. doi: 10.1007/s10107-022-01879-4. Epub 2022 Aug 16.
8
The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints.用于具有线性约束的两模块可分凸优化问题的近端交替最小化算法
J Optim Theory Appl. 2019;182(1):110-132. doi: 10.1007/s10957-018-01454-y. Epub 2018 Dec 24.
9
A STRICTLY CONTRACTIVE PEACEMAN-RACHFORD SPLITTING METHOD FOR CONVEX PROGRAMMING.一种用于凸规划的严格收缩Peaceman-Rachford分裂方法。
SIAM J Optim. 2014 Jul;24(3):1011-1040. doi: 10.1137/13090849X.
10
An augmented Lagrangian approach to the constrained optimization formulation of imaging inverse problems.一种增强拉格朗日方法用于成像反问题的约束优化公式。
IEEE Trans Image Process. 2011 Mar;20(3):681-95. doi: 10.1109/TIP.2010.2076294. Epub 2010 Sep 13.

引用本文的文献

1
Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming.用于三模块可分凸规划的具有更大步长的增广拉格朗日方法的改进混合分解
J Inequal Appl. 2018;2018(1):269. doi: 10.1186/s13660-018-1863-z. Epub 2018 Oct 4.

本文引用的文献

1
The symmetric ADMM with indefinite proximal regularization and its application.具有不定近端正则化的对称交替方向乘子法及其应用。
J Inequal Appl. 2017;2017(1):172. doi: 10.1186/s13660-017-1447-3. Epub 2017 Jul 21.
2
A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming.用于两模块可分凸规划的乘子交替方向法的对称形式。
J Inequal Appl. 2017;2017(1):129. doi: 10.1186/s13660-017-1405-0. Epub 2017 Jun 5.
3
The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization.具有不定近端正则化的近端交替方向乘子法的收敛速度
J Inequal Appl. 2017;2017(1):19. doi: 10.1186/s13660-017-1295-1. Epub 2017 Jan 14.