Constructing a subgradient from directional derivatives for functions of two variables

Kamil A. Khan, Yingwei Yuan
{"title":"Constructing a subgradient from directional derivatives for functions of two variables","authors":"Kamil A. Khan, Yingwei Yuan","doi":"10.46298/jnsao-2020-6061","DOIUrl":null,"url":null,"abstract":"For any scalar-valued bivariate function that is locally Lipschitz continuous and directionally differentiable, it is shown that a subgradient may always be constructed from the function's directional derivatives in the four compass directions, arranged in a so-called \"compass difference\". When the original function is nonconvex, the obtained subgradient is an element of Clarke's generalized gradient, but the result appears to be novel even for convex functions. The function is not required to be represented in any particular form, and no further assumptions are required, though the result is strengthened when the function is additionally L-smooth in the sense of Nesterov. For certain optimal-value functions and certain parametric solutions of differential equation systems, these new results appear to provide the only known way to compute a subgradient. These results also imply that centered finite differences will converge to a subgradient for bivariate nonsmooth functions. As a dual result, we find that any compact convex set in two dimensions contains the midpoint of its interval hull. Examples are included for illustration, and it is demonstrated that these results do not extend directly to functions of more than two variables or sets in higher dimensions.","PeriodicalId":250939,"journal":{"name":"Journal of Nonsmooth Analysis and Optimization","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Nonsmooth Analysis and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/jnsao-2020-6061","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

For any scalar-valued bivariate function that is locally Lipschitz continuous and directionally differentiable, it is shown that a subgradient may always be constructed from the function's directional derivatives in the four compass directions, arranged in a so-called "compass difference". When the original function is nonconvex, the obtained subgradient is an element of Clarke's generalized gradient, but the result appears to be novel even for convex functions. The function is not required to be represented in any particular form, and no further assumptions are required, though the result is strengthened when the function is additionally L-smooth in the sense of Nesterov. For certain optimal-value functions and certain parametric solutions of differential equation systems, these new results appear to provide the only known way to compute a subgradient. These results also imply that centered finite differences will converge to a subgradient for bivariate nonsmooth functions. As a dual result, we find that any compact convex set in two dimensions contains the midpoint of its interval hull. Examples are included for illustration, and it is demonstrated that these results do not extend directly to functions of more than two variables or sets in higher dimensions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
从两个变量函数的方向导数构造子梯度
对于任何局部Lipschitz连续且方向可微的标量值二元函数,证明了一个子梯度总是可以由函数在四个罗盘方向上的方向导数构造而成,这些方向导数排列在所谓的“罗盘差分”中。当原函数非凸时,得到的子梯度是Clarke广义梯度的一个元素,但即使对于凸函数,结果也显得新颖。该函数不需要以任何特定的形式表示,也不需要进一步的假设,尽管当函数在Nesterov意义上是额外的l -光滑时,结果得到了加强。对于某些最优值函数和微分方程组的某些参数解,这些新结果似乎提供了计算子梯度的唯一已知方法。这些结果也意味着中心有限差分将收敛于二元非光滑函数的子梯度。作为对偶结果,我们发现在二维空间中任何紧致凸集都包含其区间壳的中点。举例说明,并证明这些结果不能直接推广到两个以上变量的函数或更高维度的集合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Optimal Control of a Viscous Two-Field Damage Model with Fatigue Proximal gradient methods beyond monotony Analysis of the implicit Euler time-discretization of passive linear descriptor complementarity systems On Convergence of Binary Trust-Region Steepest Descent Second-order conditions for non-uniformly convex integrands: quadratic growth in $L^1$
×
引用
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