Logarithmic Barrier Method Via Minorant Function for Linear Programming
From MaRDI portal
Publication:5853371
DOI10.17516/1997-1397-2019-12-2-191-201OpenAlexW2924217018WikidataQ128181833 ScholiaQ128181833MaRDI QIDQ5853371FDOQ5853371
Authors: 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
Recommendations
- Adaptation of the minorant function for linear programming
- A logarithmic barrier approach for linear programming
- Logarithmic barrier method via minorant function for linear semidefinite programming
- scientific article; zbMATH DE number 7473683
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Convex Analysis
- Bounds for eigenvalues using traces
- New bounds for the extreme values of a finite sample of real numbers
- A logarithmic barrier approach for linear programming
- A logarithm barrier method for semi-definite programming
- Title not available (Why is that?)
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
Cited In (5)
- An efficient logarithmic barrier method without line search for convex quadratic programming
- Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming
- Title not available (Why is that?)
- A novel adaptive method based on new minorant-majorant functions without line search for semidefinite optimization
- Study of a penalty method for nonlinear optimization based on a new approximate function
This page was built for publication: Logarithmic Barrier Method Via Minorant Function for Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853371)
