scientific article; zbMATH DE number 800120

zbMATH Open0832.90086MaRDI QIDQ4848211FDOQ4848211

Authors: Tiande Guo, Shiquan Wu 

Publication date: 25 September 1995

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

polynomial-time algorithminterior point algorithmprimal-dual gap

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (17)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

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)