scientific article; zbMATH DE number 4197755

zbMATH Open0725.90074MaRDI QIDQ5202848FDOQ5202848

Bahman Kalantari

Publication date: 1990

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

Recommendations

• scientific article
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
• A polynomial algorithm for the quadratic programming problem
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations

zbMATH Keywords

NP-completegeneralized Karmarkar potential function

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (10)

• Diagonal matrix scaling is NP-hard
• Semidefinite programming and matrix scaling over the semidefinite cone.
• A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
• Title not available (Why is that?)
• A procedure of Chvátal for testing feasibility in linear programming and matrix scaling
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Generalization of Karmarkar's algorithm to convex homogeneous functions
• On linear programming and matrix scaling over the algebraic numbers
• A characterization theorem and an algorithm for a convex hull problem
• A simple canonical form for nonlinear programming problems and its use

Uses Software

• GQTPAR

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 Q5202848)