具有新搜索方向的线性互补问题大步算法

IF 1.6 3区 数学 Q2 MATHEMATICS, APPLIED
Zsolt Darvay, Gizella Noémi Márk
{"title":"具有新搜索方向的线性互补问题大步算法","authors":"Zsolt Darvay, Gizella Noémi Márk","doi":"10.1080/02331934.2024.2396541","DOIUrl":null,"url":null,"abstract":"Recently, [Darvay Zs, Takács PR: Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood. Cent Eur J Oper Res. 2018;26(3):551–563] introduced a new large-step ...","PeriodicalId":54671,"journal":{"name":"Optimization","volume":"3 1","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Large-step algorithm for linear complementarity problem with new search direction\",\"authors\":\"Zsolt Darvay, Gizella Noémi Márk\",\"doi\":\"10.1080/02331934.2024.2396541\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, [Darvay Zs, Takács PR: Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood. Cent Eur J Oper Res. 2018;26(3):551–563] introduced a new large-step ...\",\"PeriodicalId\":54671,\"journal\":{\"name\":\"Optimization\",\"volume\":\"3 1\",\"pages\":\"\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2024-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/02331934.2024.2396541\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/02331934.2024.2396541","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

最近,[Darvay Zs, Takács PR:基于新宽邻域的线性优化大步内点算法。Cent Eur J Oper Res. 2018;26(3):551-563] 引入了一种新的大步 ...
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Large-step algorithm for linear complementarity problem with new search direction
Recently, [Darvay Zs, Takács PR: Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood. Cent Eur J Oper Res. 2018;26(3):551–563] introduced a new large-step ...
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Optimization
Optimization 数学-应用数学
CiteScore
4.50
自引率
9.10%
发文量
146
审稿时长
4.5 months
期刊介绍: Optimization publishes refereed, theoretical and applied papers on the latest developments in fields such as linear, nonlinear, stochastic, parametric, discrete and dynamic programming, control theory and game theory. A special section is devoted to review papers on theory and methods in interesting areas of mathematical programming and optimization techniques. The journal also publishes conference proceedings, book reviews and announcements. All published research articles in this journal have undergone rigorous peer review, based on initial editor screening and anonymous refereeing by independent expert referees.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信