scientific article; zbMATH DE number 4193461

zbMath0723.90061MaRDI QIDQ5202031

C. M. Shetty, Mohamed Ben-Daya

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex quadratic programminginequality constraintsprimal polynomial-time barrier function algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Unified complexity analysis for Newton LP methods ⋮ Exterior point algorithms for nearest points and convex quadratic programs ⋮ On the convergence of the method of analytic centers when applied to convex quadratic programs ⋮ A new penalty function algorithm for convex quadratic programming ⋮ Algorithms for the solution of quadratic knapsack problems

This page was built for publication: