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

Mathematical Programming Computation最新文献

筛选
英文 中文
Implementation of an interior point method with basis preconditioning 基于基预处理的内点法的实现
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-02-24 DOI: 10.1007/s12532-020-00181-8
Lukas Schork, J. Gondzio
{"title":"Implementation of an interior point method with basis preconditioning","authors":"Lukas Schork, J. Gondzio","doi":"10.1007/s12532-020-00181-8","DOIUrl":"https://doi.org/10.1007/s12532-020-00181-8","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"146 1","pages":"603 - 635"},"PeriodicalIF":6.3,"publicationDate":"2020-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74491884","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
An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables 提出了一种基于原始方向和非单调线的整数变量黑盒优化问题搜索算法框架
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-02-23 DOI: 10.1007/s12532-020-00182-7
G. Liuzzi, S. Lucidi, F. Rinaldi
{"title":"An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables","authors":"G. Liuzzi, S. Lucidi, F. Rinaldi","doi":"10.1007/s12532-020-00182-7","DOIUrl":"https://doi.org/10.1007/s12532-020-00182-7","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"1 1","pages":"673 - 702"},"PeriodicalIF":6.3,"publicationDate":"2020-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83987110","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}
引用次数: 14
Parallel and distributed asynchronous adaptive stochastic gradient methods 并行和分布式异步自适应随机梯度方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-02-21 DOI: 10.1007/s12532-023-00237-5
Yangyang Xu, Yibo Xu, Yonggui Yan, Colin Sutcher-Shepard, Leopold Grinberg, Jiewei Chen
{"title":"Parallel and distributed asynchronous adaptive stochastic gradient methods","authors":"Yangyang Xu, Yibo Xu, Yonggui Yan, Colin Sutcher-Shepard, Leopold Grinberg, Jiewei Chen","doi":"10.1007/s12532-023-00237-5","DOIUrl":"https://doi.org/10.1007/s12532-023-00237-5","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"117 1","pages":"1-38"},"PeriodicalIF":6.3,"publicationDate":"2020-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88471607","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
Outer approximation with conic certificates for mixed-integer convex problems 混合整数凸问题的二次证明外逼近
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-02-20 DOI: 10.1007/s12532-020-00178-3
C. Coey, Miles Lubin, J. Vielma
{"title":"Outer approximation with conic certificates for mixed-integer convex problems","authors":"C. Coey, Miles Lubin, J. Vielma","doi":"10.1007/s12532-020-00178-3","DOIUrl":"https://doi.org/10.1007/s12532-020-00178-3","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"78 1","pages":"249 - 293"},"PeriodicalIF":6.3,"publicationDate":"2020-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77230878","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
Parsimonious formulations for low-diameter clusters 低直径星团的简约公式
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-01-30 DOI: 10.1007/s12532-020-00175-6
Hosseinali Salemi, Austin Buchanan
{"title":"Parsimonious formulations for low-diameter clusters","authors":"Hosseinali Salemi, Austin Buchanan","doi":"10.1007/s12532-020-00175-6","DOIUrl":"https://doi.org/10.1007/s12532-020-00175-6","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"44 1","pages":"493 - 528"},"PeriodicalIF":6.3,"publicationDate":"2020-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85572004","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}
引用次数: 15
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery 噪声结构低秩矩阵恢复的多阶段凸松弛方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-01-29 DOI: 10.1007/s12532-020-00177-4
Shujun Bi, S. Pan, Defeng Sun
{"title":"A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery","authors":"Shujun Bi, S. Pan, Defeng Sun","doi":"10.1007/s12532-020-00177-4","DOIUrl":"https://doi.org/10.1007/s12532-020-00177-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"23 1","pages":"569 - 602"},"PeriodicalIF":6.3,"publicationDate":"2020-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72883334","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
Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization 大规模非凸极小化的有限记忆拟牛顿方法的正则化
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-11-11 DOI: 10.1007/s12532-023-00238-4
D. Steck, C. Kanzow
{"title":"Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization","authors":"D. Steck, C. Kanzow","doi":"10.1007/s12532-023-00238-4","DOIUrl":"https://doi.org/10.1007/s12532-023-00238-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"84 1","pages":"417 - 444"},"PeriodicalIF":6.3,"publicationDate":"2019-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85567388","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
acados—a modular open-source framework for fast embedded optimal control acados -用于快速嵌入式最优控制的模块化开源框架
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-10-30 DOI: 10.1007/s12532-021-00208-8
Robin Verschueren, G. Frison, D. Kouzoupis, Jonathan Frey, N. V. Duijkeren, Andrea Zanelli, B. Novoselnik, Thivaharan Albin, R. Quirynen, M. Diehl
{"title":"acados—a modular open-source framework for fast embedded optimal control","authors":"Robin Verschueren, G. Frison, D. Kouzoupis, Jonathan Frey, N. V. Duijkeren, Andrea Zanelli, B. Novoselnik, Thivaharan Albin, R. Quirynen, M. Diehl","doi":"10.1007/s12532-021-00208-8","DOIUrl":"https://doi.org/10.1007/s12532-021-00208-8","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"332 1","pages":"147 - 183"},"PeriodicalIF":6.3,"publicationDate":"2019-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79728593","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}
引用次数: 184
A rotation-based branch-and-price approach for the nurse scheduling problem 一个基于轮换的分支和价格方法的护士调度问题
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-10-08 DOI: 10.1007/s12532-019-00172-4
A. Legrain, J. Omer, Samuel Rosat
{"title":"A rotation-based branch-and-price approach for the nurse scheduling problem","authors":"A. Legrain, J. Omer, Samuel Rosat","doi":"10.1007/s12532-019-00172-4","DOIUrl":"https://doi.org/10.1007/s12532-019-00172-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"29 1","pages":"417 - 450"},"PeriodicalIF":6.3,"publicationDate":"2019-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78983040","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}
引用次数: 26
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
首页 上一页 下一页 尾页
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学术官方微信