首页 > 最新文献

Mathematical Programming Computation最新文献

英文 中文
Faster exact solution of sparse MaxCut and QUBO problems 更快的精确求解稀疏MaxCut和QUBO问题
IF 6.3 1区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
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":"1 1","pages":"1-26"},"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区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
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":"46 1","pages":"417 - 450"},"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区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
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":"29 1","pages":"365 - 414"},"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区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
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":"51 7","pages":"227-267"},"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区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
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":"165 6 1","pages":"271 - 318"},"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区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
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":"11 1","pages":"1 - 41"},"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区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
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":"2 1","pages":"85 - 120"},"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区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
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":"94 1","pages":"415 - 416"},"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
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization 零阶随机优化的自适应采样拟牛顿方法
IF 6.3 1区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Mathematical Programming Computation
Pub Date : 2021-09-24 DOI: 10.1007/s12532-023-00233-9
Raghu Bollapragada, Stefan M. Wild
{"title":"Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization","authors":"Raghu Bollapragada, Stefan M. Wild","doi":"10.1007/s12532-023-00233-9","DOIUrl":"https://doi.org/10.1007/s12532-023-00233-9","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"51 1","pages":"327-364"},"PeriodicalIF":6.3,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86650003","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
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees 具有理论保证的有保障增广拉格朗日方法的尺度停止准则
IF 6.3 1区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Mathematical Programming Computation
Pub Date : 2021-09-18 DOI: 10.1007/s12532-021-00207-9
R. Andreani, G. Haeser, M. L. Schuverdt, L. Secchin, P. J. S. Silva
{"title":"On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees","authors":"R. Andreani, G. Haeser, M. L. Schuverdt, L. Secchin, P. J. S. Silva","doi":"10.1007/s12532-021-00207-9","DOIUrl":"https://doi.org/10.1007/s12532-021-00207-9","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"44 1","pages":"121 - 146"},"PeriodicalIF":6.3,"publicationDate":"2021-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80700269","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
首页 上一页 下一页 尾页
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
Mathematical Programming Computation
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
×
引用
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