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

Mathematical Programming Computation最新文献

筛选
英文 中文
Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization 大规模优化的有限内存共方向方法:收敛、并行化和分布式优化
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-03-29 DOI: 10.1007/s12532-022-00219-z
Ching-pei Lee, Po-Wei Wang, Chih-Jen Lin
{"title":"Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization","authors":"Ching-pei Lee, Po-Wei Wang, Chih-Jen Lin","doi":"10.1007/s12532-022-00219-z","DOIUrl":"https://doi.org/10.1007/s12532-022-00219-z","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2022-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72576581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Efficient MIP techniques for computing the relaxation complexity 计算松弛复杂度的高效MIP技术
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-03-10 DOI: 10.1007/s12532-023-00241-9
G. Averkov, Christopher Hojny, Matthias Schymura
{"title":"Efficient MIP techniques for computing the relaxation complexity","authors":"G. Averkov, Christopher Hojny, Matthias Schymura","doi":"10.1007/s12532-023-00241-9","DOIUrl":"https://doi.org/10.1007/s12532-023-00241-9","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2022-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89554172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Faster exact solution of sparse MaxCut and QUBO problems 更快的精确求解稀疏MaxCut和QUBO问题
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-02-04 DOI: 10.1007/s12532-023-00236-6
D. Rehfeldt, T. Koch, Y. Shinano
{"title":"Faster exact solution of sparse MaxCut and QUBO problems","authors":"D. Rehfeldt, T. Koch, Y. Shinano","doi":"10.1007/s12532-023-00236-6","DOIUrl":"https://doi.org/10.1007/s12532-023-00236-6","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2022-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88425889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
A penalized method of alternating projections for weighted low-rank hankel matrix optimization 加权低秩汉克尔矩阵优化的交替投影惩罚方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-02-03 DOI: 10.1007/s12532-022-00217-1
Jian Shen, Jein-Shan Chen, H. Qi, N. Xiu
{"title":"A penalized method of alternating projections for weighted low-rank hankel matrix optimization","authors":"Jian Shen, Jein-Shan Chen, H. Qi, N. Xiu","doi":"10.1007/s12532-022-00217-1","DOIUrl":"https://doi.org/10.1007/s12532-022-00217-1","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85564407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient unconstrained black box optimization 高效无约束黑盒优化
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-02-03 DOI: 10.1007/s12532-021-00215-9
M. Kimiaei, A. Neumaier
{"title":"Efficient unconstrained black box optimization","authors":"M. Kimiaei, A. Neumaier","doi":"10.1007/s12532-021-00215-9","DOIUrl":"https://doi.org/10.1007/s12532-021-00215-9","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80016725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
A memetic procedure for global multi-objective optimization 全局多目标优化的模因算法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-01-27 DOI: 10.1007/s12532-022-00231-3
M. Lapucci, Pierluigi Mansueto, F. Schoen
{"title":"A memetic procedure for global multi-objective optimization","authors":"M. Lapucci, Pierluigi Mansueto, F. Schoen","doi":"10.1007/s12532-022-00231-3","DOIUrl":"https://doi.org/10.1007/s12532-022-00231-3","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2022-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72404904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
LMBOPT: a limited memory method for bound-constrained optimization LMBOPT:约束优化的有限内存方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-01-10 DOI: 10.1007/s12532-021-00213-x
M. Kimiaei, A. Neumaier, Behzad Azmi
{"title":"LMBOPT: a limited memory method for bound-constrained optimization","authors":"M. Kimiaei, A. Neumaier, Behzad Azmi","doi":"10.1007/s12532-021-00213-x","DOIUrl":"https://doi.org/10.1007/s12532-021-00213-x","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2022-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83322445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Scalable branching on dual decomposition of stochastic mixed-integer programming problems 随机混合整数规划问题对偶分解的可伸缩分支
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-01-04 DOI: 10.1007/s12532-021-00212-y
Kibaek Kim, B. Dandurand
{"title":"Scalable branching on dual decomposition of stochastic mixed-integer programming problems","authors":"Kibaek Kim, B. Dandurand","doi":"10.1007/s12532-021-00212-y","DOIUrl":"https://doi.org/10.1007/s12532-021-00212-y","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2022-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87515456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dantzig–Wolfe reformulations for binary quadratic problems 二元二次问题的dantzigg - wolfe重新表述
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-01-03 DOI: 10.1007/s12532-021-00206-w
A. Ceselli, Lucas Létocart, Emiliano Traversi
{"title":"Dantzig–Wolfe reformulations for binary quadratic problems","authors":"A. Ceselli, Lucas Létocart, Emiliano Traversi","doi":"10.1007/s12532-021-00206-w","DOIUrl":"https://doi.org/10.1007/s12532-021-00206-w","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78375676","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Correction to: Asynchronous Lagrangian scenario decomposition 修正:异步拉格朗日场景分解
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2021-11-03 DOI: 10.1007/s12532-021-00211-z
I. Aravena, A. Papavasiliou
{"title":"Correction to: Asynchronous Lagrangian scenario decomposition","authors":"I. Aravena, A. Papavasiliou","doi":"10.1007/s12532-021-00211-z","DOIUrl":"https://doi.org/10.1007/s12532-021-00211-z","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2021-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84347550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
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学术官方微信