Some properties of solution sets to nonconvex quadratic programming problems
From MaRDI portal
Publication:5423641
Recommendations
- On nonconvex quadratic programming with box constraints
- Properties of the general quadratic optimization problem and the corresponding linear complementarity problem
- scientific article; zbMATH DE number 3866053
- A simple characterization of solutions sets of convex programs
- scientific article; zbMATH DE number 3936940
Cites work
Cited in
(6)- scientific article; zbMATH DE number 7313237 (Why is no real title available?)
- scientific article; zbMATH DE number 6263004 (Why is no real title available?)
- scientific article; zbMATH DE number 3866053 (Why is no real title available?)
- Global infimum of strictly convex quadratic functions with bounded perturbations
- Properties of the general quadratic optimization problem and the corresponding linear complementarity problem
- Maximizing strictly convex quadratic functions with bounded perturbations
This page was built for publication: Some properties of solution sets to nonconvex quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5423641)