A decomposition method for quadratic programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4045481
- A Decomposition Method for Quadratic Zero-One Programming
- scientific article; zbMATH DE number 1190656
- A decomposition algorithm for solving large-scale quadratic programming problems
- Analysis of a quadratic programming decomposition algorithm
- scientific article; zbMATH DE number 4204122
- A method for quadratic programming
- scientific article; zbMATH DE number 724211
- scientific article; zbMATH DE number 3959124
- A Decomposition Method and Its Application to Convex Programming
Cited in
(12)- Resolving degeneracy in quadratic programming
- On the number of securities which constitute an efficient portfolio
- A method of complementary basis for quadratic programming
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
- A decomposition algorithm for solving large-scale quadratic programming problems
- scientific article; zbMATH DE number 4217201 (Why is no real title available?)
- scientific article; zbMATH DE number 3982921 (Why is no real title available?)
- scientific article; zbMATH DE number 4045481 (Why is no real title available?)
- scientific article; zbMATH DE number 1190656 (Why is no real title available?)
- Quadratic factorization heuristics for copositive programming
- A graph-based decomposition method for convex quadratic optimization with indicators
- Decomposition method for solving the quadratic programming problem in the aircraft assembly modeling
This page was built for publication: A decomposition method for quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323676)
