Nonconvex Quadratic Programming via Generalized Polars
From MaRDI portal
Cited in
(5)- Quadratic programming problems and related linear complementarity problems
- On the redundancy of cutting planes for linear complementarity problems
- Optimization of linear-convex programs
- Stability in disjunctive optimization II:continuity of the feasible and optimal set
- Global optimization algorithms for linearly constrained indefinite quadratic problems
This page was built for publication: Nonconvex Quadratic Programming via Generalized Polars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3212924)