凸矩阵值函数的次微分

IF 1.3 4区 数学 Q2 MATHEMATICS, APPLIED
{"title":"凸矩阵值函数的次微分","authors":"","doi":"10.1007/s11590-024-02105-0","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Subdifferentials (in the sense of convex analysis) of matrix-valued functions defined on <span> <span>\\(\\mathbb {R}^d\\)</span> </span> that are convex with respect to the Löwner partial order can have a complicated structure and might be very difficult to compute even in simple cases. The aim of this paper is to study subdifferential calculus for such functions and properties of their subdifferentials. We show that many standard results from convex analysis no longer hold true in the matrix-valued case. For example, in this case the subdifferential of the sum is not equal to the sum of subdifferentials, the Clarke subdifferential is not equal to the subdifferential in the sense of convex analysis, etc. Nonetheless, it is possible to provide simple rules for computing nonempty subsets of subdifferentials (in particular, individual subgradients) of convex matrix-valued functions in the general case and to completely describe subdifferentials of such functions defined on the real line. As a by-product of our analysis, we derive some interesting properties of convex matrix-valued functions, e.g. we show that if such function is nonsmooth, then its diagonal elements must be nonsmooth as well.</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"9 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Subdifferentials of convex matrix-valued functions\",\"authors\":\"\",\"doi\":\"10.1007/s11590-024-02105-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3>Abstract</h3> <p>Subdifferentials (in the sense of convex analysis) of matrix-valued functions defined on <span> <span>\\\\(\\\\mathbb {R}^d\\\\)</span> </span> that are convex with respect to the Löwner partial order can have a complicated structure and might be very difficult to compute even in simple cases. The aim of this paper is to study subdifferential calculus for such functions and properties of their subdifferentials. We show that many standard results from convex analysis no longer hold true in the matrix-valued case. For example, in this case the subdifferential of the sum is not equal to the sum of subdifferentials, the Clarke subdifferential is not equal to the subdifferential in the sense of convex analysis, etc. Nonetheless, it is possible to provide simple rules for computing nonempty subsets of subdifferentials (in particular, individual subgradients) of convex matrix-valued functions in the general case and to completely describe subdifferentials of such functions defined on the real line. As a by-product of our analysis, we derive some interesting properties of convex matrix-valued functions, e.g. we show that if such function is nonsmooth, then its diagonal elements must be nonsmooth as well.</p>\",\"PeriodicalId\":49720,\"journal\":{\"name\":\"Optimization Letters\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2024-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Optimization Letters\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11590-024-02105-0\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Letters","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11590-024-02105-0","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

摘要 定义在 \(\mathbb {R}^d\) 上的矩阵值函数的子微分(在凸分析的意义上),相对于 Löwner 偏序是凸的,可能具有复杂的结构,即使在简单的情况下也可能非常难以计算。本文旨在研究这类函数的子微分学及其子微分的性质。我们证明,凸分析的许多标准结果在矩阵值情况下不再成立。例如,在这种情况下,和的次微分不等于次微分之和,克拉克次微分不等于凸分析意义上的次微分,等等。尽管如此,在一般情况下,我们还是有可能提供计算凸矩阵值函数子微分(尤其是各个子梯度)非空子集的简单规则,并完整地描述定义在实线上的此类函数的子微分。作为分析的副产品,我们推导出了凸矩阵值函数的一些有趣性质,例如,我们证明了如果这类函数是非光滑的,那么它的对角线元素也一定是非光滑的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Subdifferentials of convex matrix-valued functions

Abstract

Subdifferentials (in the sense of convex analysis) of matrix-valued functions defined on \(\mathbb {R}^d\) that are convex with respect to the Löwner partial order can have a complicated structure and might be very difficult to compute even in simple cases. The aim of this paper is to study subdifferential calculus for such functions and properties of their subdifferentials. We show that many standard results from convex analysis no longer hold true in the matrix-valued case. For example, in this case the subdifferential of the sum is not equal to the sum of subdifferentials, the Clarke subdifferential is not equal to the subdifferential in the sense of convex analysis, etc. Nonetheless, it is possible to provide simple rules for computing nonempty subsets of subdifferentials (in particular, individual subgradients) of convex matrix-valued functions in the general case and to completely describe subdifferentials of such functions defined on the real line. As a by-product of our analysis, we derive some interesting properties of convex matrix-valued functions, e.g. we show that if such function is nonsmooth, then its diagonal elements must be nonsmooth as well.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Optimization Letters
Optimization Letters 管理科学-应用数学
CiteScore
3.40
自引率
6.20%
发文量
116
审稿时长
9 months
期刊介绍: Optimization Letters is an international journal covering all aspects of optimization, including theory, algorithms, computational studies, and applications, and providing an outlet for rapid publication of short communications in the field. Originality, significance, quality and clarity are the essential criteria for choosing the material to be published. Optimization Letters has been expanding in all directions at an astonishing rate during the last few decades. New algorithmic and theoretical techniques have been developed, the diffusion into other disciplines has proceeded at a rapid pace, and our knowledge of all aspects of the field has grown even more profound. At the same time one of the most striking trends in optimization is the constantly increasing interdisciplinary nature of the field. Optimization Letters aims to communicate in a timely fashion all recent developments in optimization with concise short articles (limited to a total of ten journal pages). Such concise articles will be easily accessible by readers working in any aspects of optimization and wish to be informed of recent developments.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信