Semi-proximal augmented Lagrangian method for sparse estimation of high-dimensional inverse covariance matrices

WU Can, Yunhai Xiao, Li Peili
{"title":"Semi-proximal augmented Lagrangian method for sparse estimation of high-dimensional inverse covariance matrices","authors":"WU Can, Yunhai Xiao, Li Peili","doi":"10.23952/jano.2.2020.2.03","DOIUrl":null,"url":null,"abstract":". Estimating a large and sparse inverse covariance matrix is a fundamental problem in modern multivariate analysis. Recently, a generalized model for a sparse estimation was proposed in which an explicit eigenvalue bounded constraint is involved. It covers a large number of existing estimation approaches as special cases. It was shown that the dual of the generalized model contains five separable blocks, which cause more challenges for minimizing. In this paper, we use an augmented Lagrangian method to solve the dual problem, but we minimize the augmented Lagrangian function with respect to each variable in a Jacobian manner, and add a proximal point term to make each subproblem easy to solve. We show that this iterative scheme is equivalent to adding a proximal point term to the augmented Lagrangian function, and its convergence can be directly followed. Finally, we give numerical simulations by using the synthetic data which show that the proposed algorithm is very effective in estimating high-dimensional sparse inverse covariance matrices.","PeriodicalId":205734,"journal":{"name":"Journal of Applied and Numerical Optimization","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Numerical Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23952/jano.2.2020.2.03","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

. Estimating a large and sparse inverse covariance matrix is a fundamental problem in modern multivariate analysis. Recently, a generalized model for a sparse estimation was proposed in which an explicit eigenvalue bounded constraint is involved. It covers a large number of existing estimation approaches as special cases. It was shown that the dual of the generalized model contains five separable blocks, which cause more challenges for minimizing. In this paper, we use an augmented Lagrangian method to solve the dual problem, but we minimize the augmented Lagrangian function with respect to each variable in a Jacobian manner, and add a proximal point term to make each subproblem easy to solve. We show that this iterative scheme is equivalent to adding a proximal point term to the augmented Lagrangian function, and its convergence can be directly followed. Finally, we give numerical simulations by using the synthetic data which show that the proposed algorithm is very effective in estimating high-dimensional sparse inverse covariance matrices.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高维逆协方差矩阵稀疏估计的半近端增广拉格朗日方法
. 估计一个大而稀疏的逆协方差矩阵是现代多变量分析中的一个基本问题。最近,提出了一种包含显式特征值有界约束的稀疏估计广义模型。它涵盖了大量现有的估计方法作为特殊情况。结果表明,广义模型的对偶包含五个可分离的块,这给最小化带来了更多的挑战。本文采用增广拉格朗日方法求解对偶问题,但对每个变量用雅可比矩阵最小化增广拉格朗日函数,并增加一个近点项,使每个子问题易于求解。我们证明了这种迭代格式等价于在增广拉格朗日函数上增加一个近点项,并且可以直接遵循它的收敛性。最后,利用合成数据进行了数值模拟,结果表明该算法对高维稀疏逆协方差矩阵的估计是非常有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The boosted proximal difference-of-convex algorithm Iterative solutions of split fixed point and monotone inclusion problems in Hilbert spaces Multi-step actor-critic framework for reinforcement learning in continuous control Existence and stability to vector optimization problems via improvement sets Model predictive control of discrete-time linear systems by ADMM with applications to turbofan engine control problems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1