scientific article; zbMATH DE number 4197755
From MaRDI portal
Publication:5202848
Recommendations
- scientific article; zbMATH DE number 4201503
- 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(n3.5L) Arithmetic Operations
Cited in
(16)- 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
- Semidefinite programming and matrix scaling over the semidefinite cone.
- Diagonal matrix scaling is NP-hard
- A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- A polynomial algorithm for the quadratic programming problem
- A characterization theorem and an algorithm for a convex hull problem
- A simple canonical form for nonlinear programming problems and its use
- A procedure of Chvátal for testing feasibility in linear programming and matrix scaling
- scientific article; zbMATH DE number 4201503 (Why is no real title available?)
- scientific article; zbMATH DE number 4213759 (Why is no real title available?)
- scientific article; zbMATH DE number 4197756 (Why is no real title available?)
- scientific article; zbMATH DE number 7753388 (Why is no real title available?)
- A quadratically convergent method for linear programming
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)
