Mathematical Programming Computation最新文献

筛选
英文 中文
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems 形状约束凸回归问题的约束生成增广拉格朗日方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-12-09 DOI: 10.1007/s12532-021-00210-0
Meixia Lin, Defeng Sun, K. Toh
{"title":"An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems","authors":"Meixia Lin, Defeng Sun, K. Toh","doi":"10.1007/s12532-021-00210-0","DOIUrl":"https://doi.org/10.1007/s12532-021-00210-0","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"15 1","pages":"223 - 270"},"PeriodicalIF":6.3,"publicationDate":"2020-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89422053","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}
引用次数: 9
Benders decomposition with adaptive oracles for large scale optimization 使用自适应预言机进行大规模优化的bender分解
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-11-30 DOI: 10.1007/s12532-020-00197-0
Nicolò Mazzi, A. Grothey, K. McKinnon, Nagisa Sugishita
{"title":"Benders decomposition with adaptive oracles for large scale optimization","authors":"Nicolò Mazzi, A. Grothey, K. McKinnon, Nagisa Sugishita","doi":"10.1007/s12532-020-00197-0","DOIUrl":"https://doi.org/10.1007/s12532-020-00197-0","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"31 1","pages":"683 - 703"},"PeriodicalIF":6.3,"publicationDate":"2020-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81546270","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}
引用次数: 7
Polytope volume by descent in the face lattice and applications in social choice 面格的多面体体积下降及其在社会选择中的应用
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-11-18 DOI: 10.1007/s12532-020-00198-z
W. Bruns, Bogdan Ichim
{"title":"Polytope volume by descent in the face lattice and applications in social choice","authors":"W. Bruns, Bogdan Ichim","doi":"10.1007/s12532-020-00198-z","DOIUrl":"https://doi.org/10.1007/s12532-020-00198-z","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"53 1","pages":"415 - 442"},"PeriodicalIF":6.3,"publicationDate":"2020-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79201113","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
Minotaur: a mixed-integer nonlinear optimization toolkit Minotaur:混合整数非线性优化工具包
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-11-07 DOI: 10.1007/s12532-020-00196-1
Ashutosh Mahajan, S. Leyffer, Jeff T. Linderoth, James R. Luedtke, T. Munson
{"title":"Minotaur: a mixed-integer nonlinear optimization toolkit","authors":"Ashutosh Mahajan, S. Leyffer, Jeff T. Linderoth, James R. Luedtke, T. Munson","doi":"10.1007/s12532-020-00196-1","DOIUrl":"https://doi.org/10.1007/s12532-020-00196-1","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"35 1","pages":"301 - 338"},"PeriodicalIF":6.3,"publicationDate":"2020-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81375990","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}
引用次数: 29
A dynamic programming approach for generalized nearly isotonic optimization 广义近等压优化的动态规划方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-11-06 DOI: 10.1007/s12532-022-00229-x
Zhensheng Yu, Xuyun Chen, Xudong Li
{"title":"A dynamic programming approach for generalized nearly isotonic optimization","authors":"Zhensheng Yu, Xuyun Chen, Xudong Li","doi":"10.1007/s12532-022-00229-x","DOIUrl":"https://doi.org/10.1007/s12532-022-00229-x","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"19 1","pages":"195-225"},"PeriodicalIF":6.3,"publicationDate":"2020-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87274989","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}
引用次数: 3
Incorporating bounds from decision diagrams into integer programming 将决策图的边界整合到整数规划中
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-11-02 DOI: 10.1007/s12532-020-00191-6
Christian Tjandraatmadja, W. V. Hoeve
{"title":"Incorporating bounds from decision diagrams into integer programming","authors":"Christian Tjandraatmadja, W. V. Hoeve","doi":"10.1007/s12532-020-00191-6","DOIUrl":"https://doi.org/10.1007/s12532-020-00191-6","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"56 1","pages":"225 - 256"},"PeriodicalIF":6.3,"publicationDate":"2020-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75350277","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}
引用次数: 6
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs 非凸二次规划的近增广拉格朗日方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-10-06 DOI: 10.1007/s12532-022-00218-0
Ben Hermans, Andreas Themelis, Panagiotis Patrinos
{"title":"QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs","authors":"Ben Hermans, Andreas Themelis, Panagiotis Patrinos","doi":"10.1007/s12532-022-00218-0","DOIUrl":"https://doi.org/10.1007/s12532-022-00218-0","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"85 1","pages":"497 - 541"},"PeriodicalIF":6.3,"publicationDate":"2020-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76559447","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}
引用次数: 16
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization 二次优化乘法器多块交替方向法的随机化管理
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-09-23 DOI: 10.1007/s12532-020-00192-5
Krešimir Mihić, Mingxi Zhu, Y. Ye
{"title":"Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization","authors":"Krešimir Mihić, Mingxi Zhu, Y. Ye","doi":"10.1007/s12532-020-00192-5","DOIUrl":"https://doi.org/10.1007/s12532-020-00192-5","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"7 1","pages":"339 - 413"},"PeriodicalIF":6.3,"publicationDate":"2020-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75590237","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 hierarchy of spectral relaxations for polynomial optimization 多项式优化的谱松弛层次
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-07-17 DOI: 10.1007/s12532-023-00243-7
N. Mai, Jean B. Lasserre, Victor Magron
{"title":"A hierarchy of spectral relaxations for polynomial optimization","authors":"N. Mai, Jean B. Lasserre, Victor Magron","doi":"10.1007/s12532-023-00243-7","DOIUrl":"https://doi.org/10.1007/s12532-023-00243-7","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"17 1","pages":"651 - 701"},"PeriodicalIF":6.3,"publicationDate":"2020-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82934929","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 branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation 混合整数双层线性优化问题的分支切断算法及其实现
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-06-26 DOI: 10.1007/s12532-020-00183-6
Sahar Tahernejad, T. Ralphs, Scott DeNegre
{"title":"A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation","authors":"Sahar Tahernejad, T. Ralphs, Scott DeNegre","doi":"10.1007/s12532-020-00183-6","DOIUrl":"https://doi.org/10.1007/s12532-020-00183-6","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"90 1","pages":"529 - 568"},"PeriodicalIF":6.3,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78201453","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}
引用次数: 61
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学术官方微信