A dual method for solving positive definite quadratic programming
From MaRDI portal
Recommendations
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- A numerically stable dual method for solving strictly convex quadratic programs
- A dual-active-set algorithm for positive semi-definite quadratic programming
- Dual support method for solving convex quadratic programs
- scientific article; zbMATH DE number 4115852
Cited in
(9)- A dual-active-set algorithm for positive semi-definite quadratic programming
- Dual support method for solving convex quadratic programs
- scientific article; zbMATH DE number 3880447 (Why is no real title available?)
- A globally convergent filter interior-point method for positive definite quadratic programming
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- scientific article; zbMATH DE number 2143977 (Why is no real title available?)
- scientific article; zbMATH DE number 4115852 (Why is no real title available?)
- A numerically stable dual method for solving strictly convex quadratic programs
- Duality bound method for the general quadratic programming problem with quadratic constraints
This page was built for publication: A dual method for solving positive definite quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2735430)