On solving matrix quadratic programming problems
From MaRDI portal
(Redirected from On solving matrix quadratic programming problems)
The scalar quadratic programming problem is straightforwardly generalized to the matrix quadratic programming problem, and a solution methodology for solving the matrix quadratic programming problem is developed. The methodology is illustrated by simple numerical examples.
Recommendations
- scientific article; zbMATH DE number 4033485
- An algorithm for solving quadratic programming problems
- scientific article; zbMATH DE number 3858862
- Algorithms of solution of problems of quadratic programming and of optimal guaranteed estimation
- Quadratic programming problems with M-matrices and box constraints
Cited in
(10)- On solving a non-convex quadratic programming problem involving resistance distances in graphs
- A general linear-quadratic optimization problem
- scientific article; zbMATH DE number 3858862 (Why is no real title available?)
- scientific article; zbMATH DE number 4204122 (Why is no real title available?)
- scientific article; zbMATH DE number 4033485 (Why is no real title available?)
- scientific article; zbMATH DE number 4068621 (Why is no real title available?)
- scientific article; zbMATH DE number 4081288 (Why is no real title available?)
- scientific article; zbMATH DE number 24383 (Why is no real title available?)
- scientific article; zbMATH DE number 1223553 (Why is no real title available?)
- A closed-form solution to a quadratic programming problem in complex variables
This page was built for publication: On solving matrix quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190328)