Large-step algorithm for linear complementarity problem with new search direction

IF 1.6 3区数学 Q2 MATHEMATICS, APPLIED

Optimization Pub Date : 2024-09-02 DOI:10.1080/02331934.2024.2396541

Zsolt Darvay, Gizella Noémi Márk

引用次数: 0

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 ...

查看原文本刊更多论文

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

最近，[Darvay Zs, Takács PR：基于新宽邻域的线性优化大步内点算法。Cent Eur J Oper Res. 2018;26(3):551-563] 引入了一种新的大步 ...

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

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.