Convex quadratic programming approach
From MaRDI portal
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Quadratic programming (90C20) Convex programming (90C25) Programming involving graphs or networks (90C35) Matching models (91B68)
Recommendations
Cited in
(12)- Interval convex quadratic programming problems in a general form
- Quadratic optimization over one first-order cone
- Solving conic quadratically constrained quadratic programming problems
- Bi-parametric convex quadratic optimization
- An unconstrained convex programming approach to solving convex quadratic programming problems
- scientific article; zbMATH DE number 2096432 (Why is no real title available?)
- New results for recognizing convex-\(QP\) adverse graphs
- scientific article; zbMATH DE number 7152114 (Why is no real title available?)
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Improving an upper bound on the stability number of a graph
- A simplex like approach based on star sets for recognizing convex-QP adverse graphs
- Convex optimization approach to a single quadratically constrained quadratic minimization problem
This page was built for publication: Convex quadratic programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5940044)