Convex Methods for Rank-Constrained Optimization Problems

V. Mai, Dipankar Maity, B. Ramasubramanian, M. Rotkowitz
{"title":"Convex Methods for Rank-Constrained Optimization Problems","authors":"V. Mai, Dipankar Maity, B. Ramasubramanian, M. Rotkowitz","doi":"10.1137/1.9781611974072.18","DOIUrl":null,"url":null,"abstract":"This paper considers optimization problems which are convex, except for a constraint on the rank of a matrix variable. Minimizing or penalizing the nuclear norm of a matrix has proven to be an effective method for generally keeping its rank small, and a vast amount of recent work has focused on this technique; however, many problems require finding a matrix whose rank is constrained to be a particular value. We present a new method for these problems, introducing a convex constraint that forces the rank to be at least the desired value, while using the nuclear norm penalty to keep the rank from rising above that value. This results in a convex optimization problem that will attempt to satisfy the constraints, to minimize the objective, and will usually produce the desired rank. We further study the choice of parameter used with the nuclear norm penalty, both with and without the constraint. It is shown that another convex optimization problem can be formulated from the dual problem which will find the best parameter in some cases, and will still produce a useful result in other cases. We find that considering parameters which are negative, that is, considering rewarding the nuclear norm, as well as penalizing it, can result in better performance with the desired rank. The methods developed are demonstrated on rank-constrained semidefinite programming problems (SDPs). The first three authors contributed equally to this work. Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD 20740. email:vsmai@umd.edu Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD 20740. email:dmaity@umd.edu Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD 20740. email:rbhaskar@umd.edu Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD 20740. email:mcrotk@umd.edu","PeriodicalId":193106,"journal":{"name":"SIAM Conf. on Control and its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Conf. on Control and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611974072.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

This paper considers optimization problems which are convex, except for a constraint on the rank of a matrix variable. Minimizing or penalizing the nuclear norm of a matrix has proven to be an effective method for generally keeping its rank small, and a vast amount of recent work has focused on this technique; however, many problems require finding a matrix whose rank is constrained to be a particular value. We present a new method for these problems, introducing a convex constraint that forces the rank to be at least the desired value, while using the nuclear norm penalty to keep the rank from rising above that value. This results in a convex optimization problem that will attempt to satisfy the constraints, to minimize the objective, and will usually produce the desired rank. We further study the choice of parameter used with the nuclear norm penalty, both with and without the constraint. It is shown that another convex optimization problem can be formulated from the dual problem which will find the best parameter in some cases, and will still produce a useful result in other cases. We find that considering parameters which are negative, that is, considering rewarding the nuclear norm, as well as penalizing it, can result in better performance with the desired rank. The methods developed are demonstrated on rank-constrained semidefinite programming problems (SDPs). The first three authors contributed equally to this work. Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD 20740. email:vsmai@umd.edu Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD 20740. email:dmaity@umd.edu Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD 20740. email:rbhaskar@umd.edu Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD 20740. email:mcrotk@umd.edu
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
秩约束优化问题的凸方法
本文研究了除矩阵变量秩约束外的凸优化问题。最小化或惩罚矩阵的核范数已被证明是通常保持其秩小的有效方法,并且最近的大量工作都集中在该技术上;然而,许多问题需要找到一个矩阵,它的秩被约束为一个特定的值。我们提出了一种新的方法来解决这些问题,引入一个凸约束来强制排名至少是期望的值,同时使用核范数惩罚来防止排名超过该值。这将导致一个凸优化问题,该问题将尝试满足约束,最小化目标,并且通常会产生期望的秩。我们进一步研究了有约束和无约束情况下核范数罚参数的选择。结果表明,对偶问题可以形成另一个凸优化问题,在某些情况下可以找到最优参数,在其他情况下仍然可以得到有用的结果。我们发现,考虑负参数,即考虑奖励核规范,以及惩罚它,可以导致更好的性能与期望的排名。最后在秩约束半确定规划问题(sdp)上进行了验证。前三位作者对这项工作的贡献相同。马里兰大学电气与计算机工程系和系统研究所,马里兰大学帕克分校20740。电子邮件:vsmai@umd.edu马里兰大学电气与计算机工程系和系统研究所,马里兰大学帕克分校20740。电子邮件:dmaity@umd.edu马里兰大学电气与计算机工程系和系统研究所,马里兰大学帕克分校20740。电子邮件:rbhaskar@umd.edu马里兰大学电气与计算机工程系和系统研究所,马里兰大学帕克分校20740。电子邮件:mcrotk@umd.edu
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards a minimum L2-norm exact control of the Pauli equation Diffusive Realization of a Lyapunov Equation Solution, and Parallel Algorithms Implementation A Variable Reference Trajectory for Model-Free Glycemia Regulation Metzler Matrix Transform Determination using a Nonsmooth Optimization Technique with an Application to Interval Observers Identification of the Fragmentation Role in the Amyloid Assembling Processes and Application to their Optimization
×
引用
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