Pages that link to "Item:Q4778230"
From MaRDI portal
The following pages link to Methods for Modifying Matrix Factorizations (Q4778230):
Displaying 50 items.
- A numerically stable dual method for solving strictly convex quadratic programs (Q59165) (← links)
- A selected method for the optimal parameters of the AOR iteration (Q340382) (← links)
- Expectation propagation for nonlinear inverse problems -- with an application to electrical impedance tomography (Q348728) (← links)
- A factorization with update procedures for a KKT matrix arising in direct optimal control (Q384809) (← links)
- Limited-memory BFGS systems with diagonal updates (Q417600) (← links)
- Perturbation analysis for block downdating of the generalized Cholesky factorization (Q440899) (← links)
- An alternative use of the Riccati recursion for efficient optimization (Q450690) (← links)
- qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- Expectation propagation in linear regression models with spike-and-slab priors (Q493741) (← links)
- The topological susceptibility from grand canonical simulations in the interacting instanton liquid model: zero temperature calibrations and numerical framework (Q620721) (← links)
- A physical interpretation of factorization and factor modification in structural analysis (Q790661) (← links)
- A quasi-Newton method with sparse triple factorization for unconstrained minimization (Q797967) (← links)
- Solving the minimal least squares problem subject to bounds on the variables (Q797970) (← links)
- A quasi-Newton method with modification of one column per iteration (Q798571) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Fast block Toeplitz orthogonalization (Q911220) (← links)
- Personal report : Gene Howard Golub, 1932--2007 (Q924313) (← links)
- Orthogonal Laurent polynomials on the unit circle and snake-shaped matrix factorizations (Q1040856) (← links)
- QR factorization of Toeplitz matrices (Q1063382) (← links)
- Householder reflections versus Givens rotations in sparse orthogonal decomposition (Q1089725) (← links)
- The QR algorithm for unitary Hessenberg matrices (Q1091757) (← links)
- On estimating the condition of eigenvalues and eigenvectors (Q1094815) (← links)
- Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing (Q1100129) (← links)
- The simplex method is not always well behaved (Q1109528) (← links)
- A direct method for sparse least squares problems with lower and upper bounds (Q1112557) (← links)
- Parallel quasi-Newton methods for unconstrained optimization (Q1116897) (← links)
- Linearly constrained optimization (Q1122324) (← links)
- Least squares modifications with inverse factorizations: Parallel implications (Q1123540) (← links)
- A dual projective simplex method for linear programming (Q1129474) (← links)
- Algorithms for roundoff error analysis - a relative error approach (Q1132500) (← links)
- A quasi-Newton method with Cholesky factorization (Q1133299) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition (Q1156451) (← links)
- A computational method for the indefinite quadratic programming problem (Q1158735) (← links)
- On the orthogonal factorization and its updating in band-structured matrix computations (Q1159441) (← links)
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization (Q1184335) (← links)
- Tracking the condition number for RLS in signal processing (Q1185808) (← links)
- Adaptive Lanczos methods for recursive condition estimation (Q1186619) (← links)
- A nonlinear optimization approach for solving facility layout problems (Q1197687) (← links)
- A quasi-Gauss-Newton method for solving nonlinear algebraic equations (Q1203697) (← links)
- Discrete, linear approximation problems in polyhedral norms (Q1229548) (← links)
- Measurement updating using the U-D factorization (Q1229829) (← links)
- Pivoting techniques for symmetric Gaussian elimination (Q1232148) (← links)
- Unified approach to unconstrained minimization via basic matrix factorizations (Q1242195) (← links)
- A method for updating Cholesky factorization of a band matrix (Q1245559) (← links)
- A geometric method in nonlinear programming (Q1253613) (← links)
- Block RLS using row Householder reflections (Q1260781) (← links)
- A total least squares method for Toeplitz systems of equations (Q1272882) (← links)
- A modified layered-step interior-point algorithm for linear programming (Q1290624) (← links)
