首页 > 最新文献

Optimization Methods & Software最新文献

英文 中文
Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems 线性半有限可行性问题内点算法的超线性收敛性
IF 2.2 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-09-13 DOI: 10.1080/10556788.2024.2400705
Chee-Khian Sim
In the literature, besides the assumption of strict complementarity, superlinear convergence of implementable polynomial-time interior point algorithms using known search directions, namely, the HK...
在文献中,除了严格互补性假设之外,使用已知搜索方向的可实现多项式时间内部点算法的超线性收敛,即HK...
{"title":"Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems","authors":"Chee-Khian Sim","doi":"10.1080/10556788.2024.2400705","DOIUrl":"https://doi.org/10.1080/10556788.2024.2400705","url":null,"abstract":"In the literature, besides the assumption of strict complementarity, superlinear convergence of implementable polynomial-time interior point algorithms using known search directions, namely, the HK...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142178605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automatic source code generation for deterministic global optimization with parallel architectures 利用并行架构自动生成确定性全局优化的源代码
IF 2.2 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-09-13 DOI: 10.1080/10556788.2024.2396297
Robert X. Gottlieb, Pengfei Xu, Matthew D. Stuber
Trends over the past two decades indicate that much of the performance gains of commercial optimization solvers is due to improvements in x86 hardware. To continue making progress, it is critical t...
过去二十年的趋势表明,商业优化求解器的性能提升主要归功于 x86 硬件的改进。要想继续取得进展,关键是...
{"title":"Automatic source code generation for deterministic global optimization with parallel architectures","authors":"Robert X. Gottlieb, Pengfei Xu, Matthew D. Stuber","doi":"10.1080/10556788.2024.2396297","DOIUrl":"https://doi.org/10.1080/10556788.2024.2396297","url":null,"abstract":"Trends over the past two decades indicate that much of the performance gains of commercial optimization solvers is due to improvements in x86 hardware. To continue making progress, it is critical t...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142255600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems 一类伪凸半矢量双层优化问题的神经动力学方法
IF 2.2 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-08-14 DOI: 10.1080/10556788.2024.2380688
Tran Ngoc Thang, Dao Minh Hoang, Nguyen Viet Dung
The article proposes an exact approach to finding the global solution of a nonconvex semivectorial bilevel optimization problem, where the objective functions at each level are pseudoconvex, and th...
文章提出了一种寻找非凸半矢量双层优化问题全局解的精确方法,其中各层次的目标函数都是伪凸的,并且...
{"title":"A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems","authors":"Tran Ngoc Thang, Dao Minh Hoang, Nguyen Viet Dung","doi":"10.1080/10556788.2024.2380688","DOIUrl":"https://doi.org/10.1080/10556788.2024.2380688","url":null,"abstract":"The article proposes an exact approach to finding the global solution of a nonconvex semivectorial bilevel optimization problem, where the objective functions at each level are pseudoconvex, and th...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142178606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An investigation of stochastic trust-region based algorithms for finite-sum minimization 基于随机信任区域的有限和最小化算法研究
IF 2.2 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-08-08 DOI: 10.1080/10556788.2024.2346834
Stefania Bellavia, Benedetta Morini, Simone Rebegoldi
This work elaborates on the TRust-region-ish (TRish) algorithm, a stochastic optimization method for finite-sum minimization problems proposed by Curtis et al. in [F.E. Curtis, K. Scheinberg, and R...
这项工作详细阐述了 TRust-region-ish (TRish) 算法,这是柯蒂斯等人在[F.E. Curtis, K. Scheinberg, and R...] [F.E.柯蒂斯、K. Scheinberg 和 R...] 中提出的一种用于有限和最小化问题的随机优化方法。
{"title":"An investigation of stochastic trust-region based algorithms for finite-sum minimization","authors":"Stefania Bellavia, Benedetta Morini, Simone Rebegoldi","doi":"10.1080/10556788.2024.2346834","DOIUrl":"https://doi.org/10.1080/10556788.2024.2346834","url":null,"abstract":"This work elaborates on the TRust-region-ish (TRish) algorithm, a stochastic optimization method for finite-sum minimization problems proposed by Curtis et al. in [F.E. Curtis, K. Scheinberg, and R...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Matrix extreme points and free extreme points of free spectrahedra 自由光谱的矩阵极值点和自由极值点
IF 2.2 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-07-29 DOI: 10.1080/10556788.2024.2339221
Aidan Epperly, Eric Evert, J. William Helton, Igor Klep
Free spectrahedra are dimension free solution sets to linear matrix inequalities of the form LA(X)=Id⊗In+A1⊗X1+A2⊗X2+⋯+Ag⊗Xg⪰0, where the Ai and Xi are symmetric matrices and the Xi have any size ...
自由谱是形式为 LA(X)=Id⊗In+A1⊗X1+A2⊗X2+⋯+Ag⊗Xg⪰0 的线性矩阵不等式的无维解集,其中 Ai 和 Xi 是对称矩阵,且 Xi 的大小不限 ...
{"title":"Matrix extreme points and free extreme points of free spectrahedra","authors":"Aidan Epperly, Eric Evert, J. William Helton, Igor Klep","doi":"10.1080/10556788.2024.2339221","DOIUrl":"https://doi.org/10.1080/10556788.2024.2339221","url":null,"abstract":"Free spectrahedra are dimension free solution sets to linear matrix inequalities of the form LA(X)=Id⊗In+A1⊗X1+A2⊗X2+⋯+Ag⊗Xg⪰0, where the Ai and Xi are symmetric matrices and the Xi have any size ...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property 具有超线性收敛特性的约束多目标优化问题信任区域方案
IF 2.2 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-07-29 DOI: 10.1080/10556788.2024.2372303
Nantu Kumar Bisui, Geetanjali Panda
In this paper, a numerical approximation method is developed to find approximate solutions to a class of constrained multi-objective optimization problems. All the functions of the problem are not ...
本文开发了一种数值逼近方法,用于寻找一类受约束多目标优化问题的近似解。问题的所有函数都不是 ...
{"title":"A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property","authors":"Nantu Kumar Bisui, Geetanjali Panda","doi":"10.1080/10556788.2024.2372303","DOIUrl":"https://doi.org/10.1080/10556788.2024.2372303","url":null,"abstract":"In this paper, a numerical approximation method is developed to find approximate solutions to a class of constrained multi-objective optimization problems. All the functions of the problem are not ...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141869309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Numerical methods for distributed stochastic compositional optimization problems with aggregative structure 具有聚合结构的分布式随机组合优化问题的数值方法
IF 2.2 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-07-25 DOI: 10.1080/10556788.2024.2381214
Shengchao Zhao, Yongchao Liu
The paper studies the distributed stochastic compositional optimization problems over networks, where all the agents' inner-level function is the sum of each agent's private expectation function. F...
本文研究了网络上的分布式随机组合优化问题,其中所有代理的内层函数都是每个代理的私人期望函数之和。F...
{"title":"Numerical methods for distributed stochastic compositional optimization problems with aggregative structure","authors":"Shengchao Zhao, Yongchao Liu","doi":"10.1080/10556788.2024.2381214","DOIUrl":"https://doi.org/10.1080/10556788.2024.2381214","url":null,"abstract":"The paper studies the distributed stochastic compositional optimization problems over networks, where all the agents' inner-level function is the sum of each agent's private expectation function. F...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141869336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analysis and comparison of two-level KFAC methods for training deep neural networks 用于训练深度神经网络的两级 KFAC 方法的分析与比较
IF 2.2 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-07-24 DOI: 10.1080/10556788.2024.2380684
Abdoulaye Koroko, Ani Anciaux-Sedrakian, Ibtihel Ben Gharbia, Valérie Garès, Mounir Haddou, Quang Huy Tran
As a second-order method, the Natural Gradient Descent (NGD) has the ability to accelerate training of neural networks. However, due to the prohibitive computational and memory costs of computing a...
作为一种二阶方法,自然梯度下降法(NGD)能够加速神经网络的训练。然而,由于计算自然梯度下降(NGD)所需的计算成本和内存成本过高,NGD 无法满足神经网络的训练需求。
{"title":"Analysis and comparison of two-level KFAC methods for training deep neural networks","authors":"Abdoulaye Koroko, Ani Anciaux-Sedrakian, Ibtihel Ben Gharbia, Valérie Garès, Mounir Haddou, Quang Huy Tran","doi":"10.1080/10556788.2024.2380684","DOIUrl":"https://doi.org/10.1080/10556788.2024.2380684","url":null,"abstract":"As a second-order method, the Natural Gradient Descent (NGD) has the ability to accelerate training of neural networks. However, due to the prohibitive computational and memory costs of computing a...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A new spectral conjugate subgradient method with application in computed tomography image reconstruction 一种新的光谱共轭子梯度法在计算机断层扫描图像重建中的应用
IF 2.2 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-07-24 DOI: 10.1080/10556788.2024.2372668
M. Loreto, T. Humphries, C. Raghavan, K. Wu, S. Kwak
A new spectral conjugate subgradient method is presented to solve nonsmooth unconstrained optimization problems. The method combines the spectral conjugate gradient method for smooth problems with ...
本文提出了一种解决非光滑无约束优化问题的新谱共轭梯度法。该方法结合了用于平滑问题的谱共轭梯度法和...
{"title":"A new spectral conjugate subgradient method with application in computed tomography image reconstruction","authors":"M. Loreto, T. Humphries, C. Raghavan, K. Wu, S. Kwak","doi":"10.1080/10556788.2024.2372668","DOIUrl":"https://doi.org/10.1080/10556788.2024.2372668","url":null,"abstract":"A new spectral conjugate subgradient method is presented to solve nonsmooth unconstrained optimization problems. The method combines the spectral conjugate gradient method for smooth problems with ...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141869337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Dai–Liao-type conjugate gradient methods for solving vector optimization problems 解决矢量优化问题的戴-里奥型共轭梯度法
IF 2.2 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-07-23 DOI: 10.1080/10556788.2024.2380697
Bo-Ya Zhang, Qing-Rui He, Chun-Rong Chen, Sheng-Jie Li, Ming-Hua Li
This paper attempts to propose Dai–Liao (DL)-type nonlinear conjugate gradient (CG) methods for solving vector optimization problems. Four variants of the DL method are extended and analysed from t...
本文试图提出用于求解矢量优化问题的戴辽(DL)型非线性共轭梯度(CG)方法。本文对 DL 方法的四种变体进行了扩展和分析,从...
{"title":"The Dai–Liao-type conjugate gradient methods for solving vector optimization problems","authors":"Bo-Ya Zhang, Qing-Rui He, Chun-Rong Chen, Sheng-Jie Li, Ming-Hua Li","doi":"10.1080/10556788.2024.2380697","DOIUrl":"https://doi.org/10.1080/10556788.2024.2380697","url":null,"abstract":"This paper attempts to propose Dai–Liao (DL)-type nonlinear conjugate gradient (CG) methods for solving vector optimization problems. Four variants of the DL method are extended and analysed from t...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Optimization Methods & Software
全部 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