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

Iranian Journal of Numerical Analysis and Optimization最新文献

筛选
英文 中文
Subgradient Smoothing Method for Nonsmooth Nonconvex Optimization 非光滑非凸优化的亚梯度平滑法
Iranian Journal of Numerical Analysis and Optimization Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-72040-7_3
A. Bagirov, N. Sultanova, S. Taheri, G. Ozturk
{"title":"Subgradient Smoothing Method for Nonsmooth Nonconvex Optimization","authors":"A. Bagirov, N. Sultanova, S. Taheri, G. Ozturk","doi":"10.1007/978-3-030-72040-7_3","DOIUrl":"https://doi.org/10.1007/978-3-030-72040-7_3","url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74314722","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
A New Multi-point Stepsize Gradient Method for Optimization 一种新的多点步长梯度优化方法
Iranian Journal of Numerical Analysis and Optimization Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-72040-7_7
Yakui Huang, Yuhong Dai, Xinwei Liu
{"title":"A New Multi-point Stepsize Gradient Method for Optimization","authors":"Yakui Huang, Yuhong Dai, Xinwei Liu","doi":"10.1007/978-3-030-72040-7_7","DOIUrl":"https://doi.org/10.1007/978-3-030-72040-7_7","url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73730772","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
Computational Science in the 17th Century. Numerical Solution of Algebraic Equations: Digit–by–Digit Computation 17世纪的计算科学。代数方程的数值解:逐位计算
Iranian Journal of Numerical Analysis and Optimization Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-72040-7_12
T. Steihaug
{"title":"Computational Science in the 17th Century. Numerical Solution of Algebraic Equations: Digit–by–Digit Computation","authors":"T. Steihaug","doi":"10.1007/978-3-030-72040-7_12","DOIUrl":"https://doi.org/10.1007/978-3-030-72040-7_12","url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76090711","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}
引用次数: 3
A Survey on Modeling Approaches for Generation and Transmission Expansion Planning Analysis 发电与输电扩展规划分析建模方法综述
Iranian Journal of Numerical Analysis and Optimization Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-72040-7_9
Giovanni Micheli, M. Vespucci
{"title":"A Survey on Modeling Approaches for Generation and Transmission Expansion Planning Analysis","authors":"Giovanni Micheli, M. Vespucci","doi":"10.1007/978-3-030-72040-7_9","DOIUrl":"https://doi.org/10.1007/978-3-030-72040-7_9","url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85398908","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
On Some Optimization Problems that Can Be Solved in O(n) Time 若干可在O(n)时间内求解的优化问题
Iranian Journal of Numerical Analysis and Optimization Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-72040-7_4
Yanqin Bai, Kees Roos
{"title":"On Some Optimization Problems that Can Be Solved in O(n) Time","authors":"Yanqin Bai, Kees Roos","doi":"10.1007/978-3-030-72040-7_4","DOIUrl":"https://doi.org/10.1007/978-3-030-72040-7_4","url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90875592","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
A New Inexact Nonmonotone Filter Sequential Quadratic Programming Algorithm 一种新的非精确非单调滤波序贯二次规划算法
Iranian Journal of Numerical Analysis and Optimization Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-72040-7_1
Hani Ahmadzadeh, N. Mahdavi-Amiri
{"title":"A New Inexact Nonmonotone Filter Sequential Quadratic Programming Algorithm","authors":"Hani Ahmadzadeh, N. Mahdavi-Amiri","doi":"10.1007/978-3-030-72040-7_1","DOIUrl":"https://doi.org/10.1007/978-3-030-72040-7_1","url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78670814","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
Iteration Complexity of a Fixed-Stepsize SQP Method for Nonconvex Optimization with Convex Constraints 具有凸约束的非凸优化的定步长SQP方法的迭代复杂度
Iranian Journal of Numerical Analysis and Optimization Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-72040-7_5
F. Facchinei, V. Kungurtsev, Lorenzo Lampariello, G. Scutari
{"title":"Iteration Complexity of a Fixed-Stepsize SQP Method for Nonconvex Optimization with Convex Constraints","authors":"F. Facchinei, V. Kungurtsev, Lorenzo Lampariello, G. Scutari","doi":"10.1007/978-3-030-72040-7_5","DOIUrl":"https://doi.org/10.1007/978-3-030-72040-7_5","url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83587108","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}
引用次数: 3
Second Order Adjoints in Optimization 优化中的二阶伴随
Iranian Journal of Numerical Analysis and Optimization Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-72040-7_10
N. Petra, E. Sachs
{"title":"Second Order Adjoints in Optimization","authors":"N. Petra, E. Sachs","doi":"10.1007/978-3-030-72040-7_10","DOIUrl":"https://doi.org/10.1007/978-3-030-72040-7_10","url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75866164","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}
引用次数: 1
Modelling and Inferring the Triggering Function in a Self-Exciting Point Process 自激点过程中触发函数的建模与推断
Iranian Journal of Numerical Analysis and Optimization Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-72040-7_6
C. Gilmour, D. Higham
{"title":"Modelling and Inferring the Triggering Function in a Self-Exciting Point Process","authors":"C. Gilmour, D. Higham","doi":"10.1007/978-3-030-72040-7_6","DOIUrl":"https://doi.org/10.1007/978-3-030-72040-7_6","url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85505668","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
Largest Small n-polygons: Numerical Optimum Estimates for n ≥ 6 最大的小n多边形:n≥6的数值最优估计
Iranian Journal of Numerical Analysis and Optimization Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-72040-7_11
J. Pintér
{"title":"Largest Small n-polygons: Numerical Optimum Estimates for n ≥ 6","authors":"J. Pintér","doi":"10.1007/978-3-030-72040-7_11","DOIUrl":"https://doi.org/10.1007/978-3-030-72040-7_11","url":null,"abstract":"","PeriodicalId":36287,"journal":{"name":"Iranian Journal of Numerical Analysis and Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77130164","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}
引用次数: 4
下一页 尾页
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学术官方微信