A Comparative Numerical Study between Minorant Functions and Line Search Methods in Penalty Methods for Linear Optimization

被引：0

作者：

Leulmi, Assma ^{[1
]}

机构：

[1] Ferhat Abbas Univ Setif 1, Dept Math, Setif, Algeria

来源：

ENGINEERING TECHNOLOGY & APPLIED SCIENCE RESEARCH | 2023年 / 13卷 / 01期

关键词：

linear optimization; penalty methods; line search; minorant function; NUMBER; STEP;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The aim of this paper is to present a comparative numerical study between the minorant functions and line search methods in computing the step size in the penalty method for linear optimization. The minorant functions were confirmed by many interesting numerical experimentations to be more beneficial than the classical line search methods.

引用

页码：10073 / 10077

页数：5

共 15 条

[1] A polynomial-time weighted path-following interior-point algorithm for linear optimization [J].

Achache, Mohamed .

ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2020, 13 (02)

[2]

Armaos P, 2013, ENG TECHNOL APPL SCI, V3, P473

[3]

Badri-Koohi B, 2019, ENG TECHNOL APPL SCI, V9, P3715

[4]

Bonnans J.F., 2006, NUMERICAL OPTIMIZATI, V2nd

[5] A new efficient short-step projective interior point method for linear programming [J].

Bouafia, Mousaab ;

Benterki, Djamel ;

Yassine, Adnan .

OPERATIONS RESEARCH LETTERS, 2018, 46 (03) :291-294

[6] Geometrical properties of the Frobenius condition number for positive definite matrices [J].

Chehab, Jean-Paul ;

Raydan, Marcos .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2008, 429 (8-9) :2089-2097

[7] A logarithm barrier method for semi-definite programming [J].

Crouzeix, Jean-Pierre ;

Merikhi, Bachir .

RAIRO-OPERATIONS RESEARCH, 2008, 42 (02) :123-139

[8]

Freund R. M., 2000, HIGH PERFORMANCE OPT, P441

[9] A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].

KARMARKAR, N .

COMBINATORICA, 1984, 4 (04) :373-395

[10] Logarithmic Barrier Method Via Minorant Function for Linear Programming [J].

Leulmi, Assma ;

Leulmi, Soumia .

JOURNAL OF SIBERIAN FEDERAL UNIVERSITY-MATHEMATICS & PHYSICS, 2019, 12 (02) :191-201

← 1 2 →