2011 Matrix optimization - searching between the first and second order methods (slide).pdf

2011 Matrix optimization - searching between the first and second order methods (slide).pdf

  1. 1、本文档共37页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
2011 Matrix optimization - searching between the first and second order methods (slide)

bb b b b b b b b b b b b bb b b b b b b b b b b b b b b b b b b b b Matrix Optimization: Searching between the First and Second Order Methods Defeng Sun Department of Mathematics and Risk Management Institute National University of Singapore May 17, 2011 The Matrix Optimization Problem The SIAM Conference on Optimization 2011, Darmstadt NUS/SUN – 2 / 37 We consider the “standard” matrix optimization problem (MOP) and its dual: (P) min 〈c, x〉+ f(x) s.t. Ax = b and (D) max 〈b, y〉 ? f?(z) s.t. A?y ? c = z , where X is the Cartesian product of several finite dimensional real matrix spaces, symmetric or non-symmetric, A? is the adjoint of the linear operator A : X → ?m, c ∈ X , b ∈ ?m, f : X → (?∞,∞] is a closed proper convex function with its Fenchel conjugate f?. The SIAM Conference on Optimization 2011, Darmstadt NUS/SUN – 3 / 37 The Fenchel conjugate of f is defined by f?(z) := sup x∈X {〈z, x〉 ? f(x)} . In standard linear programming, f(x) = δ?n + (x), the indicator function over ?n+ and f ?(x) = δ(??n + )(x). In semidefinite programming (SDP), f(x) = δSn + , the indicator function over Sn+ and f ?(x) = δ(?Sn + )(x). Desirable Properties of f The SIAM Conference on Optimization 2011, Darmstadt NUS/SUN – 4 / 37 We need conditions on f . Specifically, we require ? The Moreau-Yosida regularization of f ψf (x) := min z∈X { f(z) + 1 2 ‖z ? x‖2 } has a closed form solution, denoted by Pf (x). ? We can easily compute the directional derivative of ?ψf(x) = x? Pf(x). ? The function ?ψf is (strongly) semismooth. The SIAM Conference on Optimization 2011, Darmstadt NUS/SUN – 5 / 37 Let us first look at one simple example with nonsymmetric matrices: min y∈?k ‖A0 ? ∑k i=1 yiAi‖2 , (1) where Ai are m by n matrices, ‖ · ‖2 is the spectral (operator) norm of matrices (the largest singular value). Use ‖ · ‖? to denote the nuclear norm (the sum of all singular values) and B1? to denote the unit nuclear norm ball. The SIAM Conference on Optimization 2011, Darmstadt NUS/SUN – 6 / 37 We c

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档