scientific article; zbMATH DE number 800120
From MaRDI portal
Publication:4848211
Recommendations
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- scientific article; zbMATH DE number 822140
- On some efficient interior point methods for nonlinear convex programming
- Interior path following primal-dual algorithms. I: Linear programming
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
Cited in
(17)- scientific article; zbMATH DE number 1047680 (Why is no real title available?)
- scientific article; zbMATH DE number 5563572 (Why is no real title available?)
- scientific article; zbMATH DE number 1145351 (Why is no real title available?)
- scientific article; zbMATH DE number 679874 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 4086908 (Why is no real title available?)
- scientific article; zbMATH DE number 5968557 (Why is no real title available?)
- A feasible BFGS interior point algorithm for solving convex minimization problems
- The use of lower bounds in minimization by the interior-point method
- Substantiation of interior point algorithms
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- A base reduction method for convex programming
- A class of infeasible interior point algorithms for convex quadratic programming
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- An Interior-Point Algorithm for Linearly Constrained Optimization
- scientific article; zbMATH DE number 895357 (Why is no real title available?)
- scientific article; zbMATH DE number 1889340 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4848211)
