Pages that link to "Item:Q4870621"

The following pages link to On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems (Q4870621):

Displaying 35 items.

• CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
• Matrix-free interior point method (Q429480) (← links)
• Backward stability analysis of weighted linear least-squares problems (Q467427) (← links)
• On the minimum convergence factor of a class of GSOR-like methods for augmented systems (Q745227) (← links)
• Modifying the inertia of matrices arising in optimization (Q1307208) (← links)
• Perturbation analysis for the generalized Cholesky factorization. (Q1412628) (← links)
• A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
• A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
• Inertia-controlling factorizations for optimization algorithms (Q1862009) (← links)
• Solution of sparse rectangular systems using LSQR and Craig (Q1907877) (← links)
• Perturbation theory for the eigenvalues of factorised symmetric matrices (Q1976911) (← links)
• \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
• A note on the perturbation analysis for the generalized Cholesky factorization (Q2266982) (← links)
• On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices (Q2305868) (← links)
• Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices (Q2332393) (← links)
• A sparse proximal implementation of the LP dual active set algorithm (Q2465650) (← links)
• Inner solvers for interior point methods for large scale nonlinear programming (Q2642630) (← links)
• Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization (Q3300857) (← links)
• Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix (Q3449796) (← links)
• (Q3727247) (← links)
• (Q3837876) (← links)
• (Q4336430) (← links)
• Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions (Q4610143) (← links)
• On the stability of the incomplete Cholesky decomposition for a singular perturbed problem, where the coefficient matrix is not an M‐matrix (Q4840002) (← links)
• Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods (Q4976341) (← links)
• Perturbation analysis of saddle-point problems (Q4978285) (← links)
• Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number (Q5058377) (← links)
• Solvers for Systems of Linear Algebraic Equations with Block-Band Matrices (Q5066554) (← links)
• Cholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms (Q5256537) (← links)
• A primal–dual regularized interior-point method for semidefinite programming (Q5268898) (← links)
• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems (Q5350438) (← links)
• A regularized interior-point method for constrained linear least squares (Q5882390) (← links)
• Mixed precision algorithms in numerical linear algebra (Q5887837) (← links)
• The factorability of symmetric matrices and some implications for statistical linear models (Q5947458) (← links)
• An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula (Q5963729) (← links)