Logarithmic Barrier Method Via Minorant Function for Linear Programming

DOI10.17516/1997-1397-2019-12-2-191-201OpenAlexW2924217018WikidataQ128181833 ScholiaQ128181833MaRDI QIDQ5853371

Soumia Leulmi, Assma Leulmi

Publication date: 18 March 2021

Published in: Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/jsfu749

zbMATH Keywords

linear programmingline searchlogarithmic barrier methods

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Related Items (3)

An efficient logarithmic barrier method without line search for convex quadratic programming ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• A logarithmic barrier approach for linear programming
• Bounds for eigenvalues using traces
• New bounds for the extreme values of a finite sample of real numbers
• A logarithm barrier method for semi-definite programming
• Convex Analysis
• Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
• Numerical optimization. Theoretical and practical aspects. Transl. from the French

This page was built for publication: Logarithmic Barrier Method Via Minorant Function for Linear Programming