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

DOI10.15372/SJNM20220207MaRDI QIDQ5882851

Djamel Benterki, Soraya Chaghoub

Publication date: 29 March 2023

Published in: Сибирский журнал вычислительной математики (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingquadratic programminginterior point methodsline searchapproximate function

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logarithmic barrier approach for linear programming
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Bounds for eigenvalues using traces
• A new penalty function algorithm for convex quadratic programming
• Algorithm and separating method for the optimisation of quadratic functions
• The Simplex Method for Quadratic Programming
• A logarithm barrier method for semi-definite programming
• A numerical feasible interior point method for linear semidefinite programs
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
• A penalty method for nonlinear programming
• Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
• Logarithmic Barrier Method Via Minorant Function for Linear Programming

This page was built for publication: An efficient logarithmic barrier method without line search for convex quadratic programming