An efficient logarithmic barrier method without line search for convex quadratic programming
From MaRDI portal
Publication:5882851
Cites work
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A logarithm barrier method for semi-definite programming
- A logarithmic barrier approach for linear programming
- A new penalty function algorithm for convex quadratic programming
- A new polynomial-time algorithm for linear programming
- A numerical feasible interior point method for linear semidefinite programs
- 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
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Bounds for eigenvalues using traces
- Logarithmic Barrier Method Via Minorant Function for Linear Programming
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
- The Simplex Method for Quadratic 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)
