The Use ofQRFactorization in Sparse Quadratic Programming and Backward Error Issues
From MaRDI portal
Publication:4943662
Recommendations
- A backward error analysis of a null space algorithm in sparse quadratic programming
- Error analysis of an algorithm for equality-constrained quadratic programming problems
- On the solution of equality constrained quadratic programming problems arising in optimization
- scientific article; zbMATH DE number 1092929
- scientific article; zbMATH DE number 1206064
Cited in
(11)- Schur complement reduction in the mixed-hybrid approximation of Darcy's law: Rounding error analysis
- A backward error analysis of a null space algorithm in sparse quadratic programming
- On the Stability of Null-Space Methods for KKT Systems
- SPMR: A family of saddle-point minimum residual solvers
- A null space algorithm for mixed finite-element approximations of Darcy's equation
- Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods
- Perturbation analysis of saddle-point problems
- Numerical solutions of symmetric saddle point problem by direct methods
- Exact QR factorizations of rectangular matrices
- Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
- Computing upper and lower bounds in interval decision trees
This page was built for publication: The Use ofQRFactorization in Sparse Quadratic Programming and Backward Error Issues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943662)
