发布求助
文献互助 智能选刊 最新文献

Open journal of mathematical optimization最新文献

筛选
英文 中文
Tight analyses for subgradient descent I: Lower bounds 子梯度下降的严密分析 I：下限
Open journal of mathematical optimization Pub Date : 2024-07-26 DOI: 10.5802/ojmo.31
Nicholas J. A. Harvey, Christopher Liaw, Sikander Randhawa
{"title":"Tight analyses for subgradient descent I: Lower bounds","authors":"Nicholas J. A. Harvey, Christopher Liaw, Sikander Randhawa","doi":"10.5802/ojmo.31","DOIUrl":"https://doi.org/10.5802/ojmo.31","url":null,"abstract":"Consider the problem of minimizing functions that are Lipschitz and convex, but not necessarily differentiable. We construct a function from this class for which the T th iterate of subgradient descent has error Ω(log( T ) / √ T ) . This matches a known upper bound of O (log( T ) / √ T ) . We prove analogous results for functions that are additionally strongly convex. There exists such a function for which the error of the T th iterate of subgradient descent has error Ω(log( T ) /T ) , matching a known upper bound of O (log( T ) /T ) . These results resolve a question posed by Shamir (2012)","PeriodicalId":477184,"journal":{"name":"Open journal of mathematical optimization","volume":"119 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141802029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The continuous quadrant penalty formulation of logical constraints 逻辑约束的连续象限罚公式
Open journal of mathematical optimization Pub Date : 2023-09-19 DOI: 10.5802/ojmo.28
Sonia Cafieri, Andrew Conn, Marcel Mongeau
{"title":"The continuous quadrant penalty formulation of logical constraints","authors":"Sonia Cafieri, Andrew Conn, Marcel Mongeau","doi":"10.5802/ojmo.28","DOIUrl":"https://doi.org/10.5802/ojmo.28","url":null,"abstract":"Could continuous optimization address efficiently logical constraints? We propose a continuous-optimization alternative to the usual discrete-optimization (big-M and complementary) formulations of logical constraints, that can lead to effective practical methods. Based on the simple idea of guiding the search of a continuous-optimization descent method towards the parts of the domain where the logical constraint is satisfied, we introduce a smooth penalty-function formulation of logical constraints, and related theoretical results. This formulation allows a direct use of state-of-the-art continuous optimization solvers. The effectiveness of the continuous quadrant penalty formulation is demonstrated on an aircraft conflict avoidance application.","PeriodicalId":477184,"journal":{"name":"Open journal of mathematical optimization","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135011359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信