Impproving the rate of convergence of the logarithmic barrier function method
From MaRDI portal
Recommendations
Cites work
- A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
- A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
- A new polynomial-time algorithm for linear programming
- A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Controlled perturbations for quadratically constrained quadratic programs
- Convex Analysis
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- On the convergence of the method of analytic centers when applied to convex quadratic programs
Cited in
(3)
This page was built for publication: Impproving the rate of convergence of the logarithmic barrier function method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4351191)