Pages that link to "Item:Q4778230"
From MaRDI portal
The following pages link to Methods for Modifying Matrix Factorizations (Q4778230):
Displayed 50 items.
- An iterative working-set method for large-scale nonconvex quadratic programming (Q1862010) (← links)
- On incremental and robust subspace learning (Q1886672) (← links)
- The convergence of quasi-Gauss-Newton methods for nonlinear problems (Q1894950) (← links)
- Stability analysis of a general Toeplitz system solver (Q1904145) (← links)
- An algorithm and stability theory for downdating the ULV decomposition (Q1913582) (← links)
- Accurate downdating of a modified Gram-Schmidt QR decomposition (Q1913594) (← links)
- Perturbation and error analyses for block downdating of a Cholesky decomposition (Q1914866) (← links)
- Low rank updated LS-SVM classifiers for fast variable selection (Q1932006) (← links)
- The fast recursive row-Householder subspace tracking algorithm (Q1957690) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A novel face-on-face contact method for nonlinear solid mechanics (Q1987905) (← links)
- A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
- Generation of orthogonal rational functions by procedures for structured matrices (Q2066217) (← links)
- Geometric adaptive Monte Carlo in random environment (Q2072631) (← links)
- On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
- A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
- Limited-memory BFGS with displacement aggregation (Q2149548) (← links)
- A note on Hammarling's algorithm for the discrete Lyapunov equation (Q2277205) (← links)
- Theory of generalized discrepancies on a ball of arbitrary finite dimensions and algorithms for finding low-discrepancy point sets (Q2294805) (← links)
- An implementation of Milstein's method for general bounded diffusions (Q2311990) (← links)
- Quasi-Newton approaches to interior point methods for quadratic problems (Q2322554) (← links)
- A perturbation analysis of the problem of downdating a Cholesky factorization (Q2365676) (← links)
- Numerical issues in computing the antitriangular factorization of symmetric indefinite matrices (Q2400798) (← links)
- Necessary and sufficient conditions for GMRES complete and partial stagnation (Q2448380) (← links)
- Fast QR factorization of Cauchy-like matrices (Q2465328) (← links)
- Perturbation scheme for online learning of features: Incremental principal component analysis (Q2476553) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- A modification to the LINPACK downdating algorithm (Q2639590) (← links)
- Bayesian optimization package: PHYSBO (Q2701242) (← links)
- Minimizing Model Fitting Objectives That Contain Spurious Local Minima by Bootstrap Restarting (Q3078718) (← links)
- On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices (Q3195438) (← links)
- A quadratically convergent method for minimizing a sum of euclidean norms (Q3321365) (← links)
- A weighted gram-schmidt method for convex quadratic programming (Q3337227) (← links)
- Equivalence of some quadratic programming algorithms (Q3343781) (← links)
- On QR factorization updatings (Q3355212) (← links)
- Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods (Q3659547) (← links)
- Procedures for optimization problems with a mixture of bounds and general linear constraints (Q3675917) (← links)
- Updating $LU$ Factorizations for Computing Stationary Distributions (Q3721678) (← links)
- Error Analysis of Some Techniques for Updating Orthogonal Decompositions (Q3856051) (← links)
- The computation of Lagrange-multiplier estimates for constrained minimization (Q3858049) (← links)
- An equivalence between two algorithms for quadratic programming (Q3895232) (← links)
- Modifications and implementation of the ellipsoid algorithm for linear programming (Q3934131) (← links)
- A critical index algorithm for nearest point problems on simplicial cones (Q3937160) (← links)
- Direct Secant Updates of Matrix Factorizations (Q3940741) (← links)
- Newton-type methods for unconstrained and linearly constrained optimization (Q4051917) (← links)
- Chebyshev solution of overdetermined systems of linear equations (Q4058016) (← links)
- Factorized Variable Metric Methods for Unconstrained Optimization (Q4133432) (← links)
- Matrix augmentation and partitioning in the updating of the basis inverse (Q4149218) (← links)
- Numerically stable methods for quadratic programming (Q4152038) (← links)
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints (Q4152044) (← links)