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

Mathematical Programming Computation最新文献

筛选
英文 中文
An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization 具有任意线性收敛内解的非精确近端增广拉格朗日框架
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-09-20 DOI: 10.1007/s12532-021-00205-x
Fei Li, Zheng Qu
{"title":"An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization","authors":"Fei Li, Zheng Qu","doi":"10.1007/s12532-021-00205-x","DOIUrl":"https://doi.org/10.1007/s12532-021-00205-x","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"21 1","pages":"583 - 644"},"PeriodicalIF":6.3,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75221687","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
A branch-and-price algorithm for capacitated hypergraph vertex separation 容量超图顶点分离的分支价格算法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-09-09 DOI: 10.1007/s12532-019-00171-5
Michael Bastubbe, M. Lübbecke
{"title":"A branch-and-price algorithm for capacitated hypergraph vertex separation","authors":"Michael Bastubbe, M. Lübbecke","doi":"10.1007/s12532-019-00171-5","DOIUrl":"https://doi.org/10.1007/s12532-019-00171-5","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"525 ","pages":"39 - 68"},"PeriodicalIF":6.3,"publicationDate":"2019-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s12532-019-00171-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72494935","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
Generation techniques for linear programming instances with controllable properties 具有可控性质的线性规划实例的生成技术
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-08-17 DOI: 10.1007/s12532-019-00170-6
S. Bowly, K. Smith‐Miles, Davaatseren Baatar, H. Mittelmann
{"title":"Generation techniques for linear programming instances with controllable properties","authors":"S. Bowly, K. Smith‐Miles, Davaatseren Baatar, H. Mittelmann","doi":"10.1007/s12532-019-00170-6","DOIUrl":"https://doi.org/10.1007/s12532-019-00170-6","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"525 1","pages":"389 - 415"},"PeriodicalIF":6.3,"publicationDate":"2019-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77874218","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
Robust Euclidean embedding via EDM optimization 基于EDM优化的鲁棒欧几里德嵌入
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-08-09 DOI: 10.1007/s12532-019-00168-0
Shenglong Zhou, N. Xiu, H. Qi
{"title":"Robust Euclidean embedding via EDM optimization","authors":"Shenglong Zhou, N. Xiu, H. Qi","doi":"10.1007/s12532-019-00168-0","DOIUrl":"https://doi.org/10.1007/s12532-019-00168-0","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"57 1","pages":"337 - 387"},"PeriodicalIF":6.3,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78830401","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}
引用次数: 11
On the impact of running intersection inequalities for globally solving polynomial optimization problems 解交不等式对全局多项式优化问题的影响
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-08-06 DOI: 10.1007/s12532-019-00169-z
Alberto Del Pia, Aida Khajavirad, N. Sahinidis
{"title":"On the impact of running intersection inequalities for globally solving polynomial optimization problems","authors":"Alberto Del Pia, Aida Khajavirad, N. Sahinidis","doi":"10.1007/s12532-019-00169-z","DOIUrl":"https://doi.org/10.1007/s12532-019-00169-z","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"20 1","pages":"165 - 191"},"PeriodicalIF":6.3,"publicationDate":"2019-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79070113","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
On integer and bilevel formulations for the k-vertex cut problem 关于k顶点切割问题的整数和双层公式
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-07-31 DOI: 10.1007/s12532-019-00167-1
Fabio Furini, I. Ljubić, E. Malaguti, P. Paronuzzi
{"title":"On integer and bilevel formulations for the k-vertex cut problem","authors":"Fabio Furini, I. Ljubić, E. Malaguti, P. Paronuzzi","doi":"10.1007/s12532-019-00167-1","DOIUrl":"https://doi.org/10.1007/s12532-019-00167-1","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"69 1","pages":"133 - 164"},"PeriodicalIF":6.3,"publicationDate":"2019-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90932959","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}
引用次数: 22
Signomial and polynomial optimization via relative entropy and partial dualization 信号和多项式优化通过相对熵和部分二值化
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-07-01 DOI: 10.1007/s12532-020-00193-4
Riley Murray, V. Chandrasekaran, A. Wierman
{"title":"Signomial and polynomial optimization via relative entropy and partial dualization","authors":"Riley Murray, V. Chandrasekaran, A. Wierman","doi":"10.1007/s12532-020-00193-4","DOIUrl":"https://doi.org/10.1007/s12532-020-00193-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"1 1","pages":"257 - 295"},"PeriodicalIF":6.3,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89089525","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}
引用次数: 35
A hybrid quasi-Newton projected-gradient method with application to Lasso and basis-pursuit denoising 拟牛顿投影梯度混合方法在Lasso和基追踪去噪中的应用
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-06-04 DOI: 10.1007/s12532-019-00163-5
Ewout van den Berg
{"title":"A hybrid quasi-Newton projected-gradient method with application to Lasso and basis-pursuit denoising","authors":"Ewout van den Berg","doi":"10.1007/s12532-019-00163-5","DOIUrl":"https://doi.org/10.1007/s12532-019-00163-5","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"29 1","pages":"1 - 38"},"PeriodicalIF":6.3,"publicationDate":"2019-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74326200","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
New exact approaches to row layout problems 行布局问题的新精确方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-05-11 DOI: 10.1007/s12532-019-00162-6
A. Fischer, F. Fischer, P. Hungerländer
{"title":"New exact approaches to row layout problems","authors":"A. Fischer, F. Fischer, P. Hungerländer","doi":"10.1007/s12532-019-00162-6","DOIUrl":"https://doi.org/10.1007/s12532-019-00162-6","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"26 1","pages":"703 - 754"},"PeriodicalIF":6.3,"publicationDate":"2019-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89589822","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}
引用次数: 25
Structure-driven fix-and-propagate heuristics for mixed integer programming 混合整数规划中结构驱动的修复-传播启发式算法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-04-06 DOI: 10.1007/s12532-019-00159-1
Gerald Gamrath, Timo Berthold, Stefan Heinz, Michael Winkler
{"title":"Structure-driven fix-and-propagate heuristics for mixed integer programming","authors":"Gerald Gamrath, Timo Berthold, Stefan Heinz, Michael Winkler","doi":"10.1007/s12532-019-00159-1","DOIUrl":"https://doi.org/10.1007/s12532-019-00159-1","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"33 1","pages":"675 - 702"},"PeriodicalIF":6.3,"publicationDate":"2019-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73215598","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书