An efficient logarithmic barrier method without line search for convex quadratic programming
From MaRDI portal
Publication:5882851
DOI10.15372/SJNM20220207MaRDI QIDQ5882851FDOQ5882851
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
Cites Work
- The Simplex Method for Quadratic Programming
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Bounds for eigenvalues using traces
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- A logarithmic barrier approach for linear programming
- A logarithm barrier method for semi-definite programming
- A numerical feasible interior point method for linear semidefinite programs
- Title not available (Why is that?)
- A new penalty function algorithm for convex quadratic programming
- A penalty method for nonlinear programming
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
- Algorithm and separating method for the optimisation of quadratic functions
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
- Logarithmic Barrier Method Via Minorant Function for Linear Programming
Cited In (3)
This page was built for publication: An efficient logarithmic barrier method without line search for convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882851)
