A numerically stable least squares solution to the quadratic programming problem
From MaRDI portal
Publication:2425561
Recommendations
- A numerically stable dual method for solving strictly convex quadratic programs
- An approximate solution to linear and quadratic programming problems by the method of least squares
- scientific article; zbMATH DE number 4003917
- Publication:4732309
- On computing a stable least squares solution to the linear programming problem.
Cites work
- A numerically stable dual method for solving strictly convex quadratic programs
- Exact and stable least squares solution to the linear programming problem
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- On stable least squares solution to the system of linear inequalities
- On the quadratic programming algorithm of Goldfarb and Idnani
Cited in
(11)- Solving quadratic programs to high precision using scaled iterative refinement
- The best approximate solution of the inconsistent linear system via a quadratic penalty function
- An approximate solution to linear and quadratic programming problems by the method of least squares
- On computing a stable least squares solution to the linear programming problem.
- scientific article; zbMATH DE number 3928729 (Why is no real title available?)
- scientific article; zbMATH DE number 4003917 (Why is no real title available?)
- An alternate numerical solution to the linear quadratic problem
- scientific article; zbMATH DE number 781292 (Why is no real title available?)
- A numerically stable dual method for solving strictly convex quadratic programs
- Mathematical programming via the least-squares method
- Numerical solution method for general interval quadratic programming
This page was built for publication: A numerically stable least squares solution to the quadratic programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425561)