Methods for Modifying Matrix Factorizations
From MaRDI portal
Publication:4778230
DOI10.2307/2005923zbMath0289.65021OpenAlexW3028969400MaRDI QIDQ4778230
Philip E. Gill, Michael A. Saunders, Walter Murray, Gene H. Golub
Publication date: 1974
Full work available at URL: https://doi.org/10.2307/2005923
Nonlinear programming (90C30) Quadratic programming (90C20) Linear programming (90C05) Linear inequalities of matrices (15A39) Linear equations (linear algebraic aspects) (15A06)
Related Items
Factorized Variable Metric Methods for Unconstrained Optimization, Error Analysis of Some Techniques for Updating Orthogonal Decompositions, Computational Experiments and Techniques for the Penalty Method with Extrapolation, Updating $LU$ Factorizations for Computing Stationary Distributions, Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs, Incremental modelling for compositional data streams, A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming, Direct Secant Updates of Matrix Factorizations, Newton-type methods for unconstrained and linearly constrained optimization, Chebyshev solution of overdetermined systems of linear equations, A geometric approach to subspace updates and orthogonal matrix decompositions under rank-one modifications, The unitary completion and QR iterations for a class of structured matrices, The computation of Lagrange-multiplier estimates for constrained minimization, Matrix augmentation and partitioning in the updating of the basis inverse, Numerically stable methods for quadratic programming, Matrix factorizations in optimization of nonlinear functions subject to linear constraints, Large-scale linearly constrained optimization, A note on the efficient solution of matrix pencil systems, An equivalence between two algorithms for quadratic programming, On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation, Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods, An algorithm for hierarchical optimization of large-scale problems with nested structure, Modifications and implementation of the ellipsoid algorithm for linear programming, A critical index algorithm for nearest point problems on simplicial cones, Procedures for optimization problems with a mixture of bounds and general linear constraints, Rank-\(k\) modification methods for recursive least squares problems, A perturbation analysis of the problem of downdating a Cholesky factorization, On incremental and robust subspace learning, Householder reflections versus Givens rotations in sparse orthogonal decomposition, The QR algorithm for unitary Hessenberg matrices, On estimating the condition of eigenvalues and eigenvectors, A modification of the Dewilde-van der Veen method for inversion of finite structured matrices, The convergence of quasi-Gauss-Newton methods for nonlinear problems, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, Limited-memory BFGS with displacement aggregation, A modification to the LINPACK downdating algorithm, Stability analysis of a general Toeplitz system solver, A selected method for the optimal parameters of the AOR iteration, The simplex method is not always well behaved, On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices, Expectation propagation for nonlinear inverse problems -- with an application to electrical impedance tomography, A direct method for sparse least squares problems with lower and upper bounds, Algebraic and numerical techniques for the computation of matrix determinants, An algorithm and stability theory for downdating the ULV decomposition, Accurate downdating of a modified Gram-Schmidt QR decomposition, Parallel quasi-Newton methods for unconstrained optimization, Numerical issues in computing the antitriangular factorization of symmetric indefinite matrices, Perturbation and error analyses for block downdating of a Cholesky decomposition, Linearly constrained optimization, Least squares modifications with inverse factorizations: Parallel implications, Updating QR factorization procedure for solution of linear least squares problem with equality constraints, A factorization with update procedures for a KKT matrix arising in direct optimal control, A dual projective simplex method for linear programming, Algorithms for roundoff error analysis - a relative error approach, A quasi-Newton method with Cholesky factorization, Low rank updated LS-SVM classifiers for fast variable selection, The topological susceptibility from grand canonical simulations in the interacting instanton liquid model: zero temperature calibrations and numerical framework, Accuracy-enhancing methods for balancing-related frequency-weighted model and controller reduction., Limited-memory BFGS systems with diagonal updates, Computational methods of linear algebra, Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition, Fast block Toeplitz orthogonalization, Perturbation analysis for block downdating of the generalized Cholesky factorization, A computational method for the indefinite quadratic programming problem, On the orthogonal factorization and its updating in band-structured matrix computations, Bayesian optimization package: PHYSBO, An alternative use of the Riccati recursion for efficient optimization, The fast recursive row-Householder subspace tracking algorithm, Computational methods for modifying seemingly unrelated regressions models., Personal report : Gene Howard Golub, 1932--2007, Necessary and sufficient conditions for GMRES complete and partial stagnation, qpOASES: a parametric active-set algorithm for~quadratic programming, A projective simplex algorithm using LU decomposition, Partitioned quasi-Newton methods for nonlinear equality constrained optimization, A polynomial time constraint-reduced algorithm for semidefinite optimization problems, Expectation propagation in linear regression models with spike-and-slab priors, Tracking the condition number for RLS in signal processing, Adaptive Lanczos methods for recursive condition estimation, Fast QR factorization of Cauchy-like matrices, A novel face-on-face contact method for nonlinear solid mechanics, A nonlinear optimization approach for solving facility layout problems, A quadratically convergent method for minimizing a sum of euclidean norms, Perturbation scheme for online learning of features: Incremental principal component analysis, A numerically stable dual method for solving strictly convex quadratic programs, A quasi-Gauss-Newton method for solving nonlinear algebraic equations, GMRES and the Arioli, Pták, and Strakoš parametrization, A weighted gram-schmidt method for convex quadratic programming, Equivalence of some quadratic programming algorithms, Discrete, linear approximation problems in polyhedral norms, Measurement updating using the U-D factorization, Pivoting techniques for symmetric Gaussian elimination, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, A note on Hammarling's algorithm for the discrete Lyapunov equation, On QR factorization updatings, Unified approach to unconstrained minimization via basic matrix factorizations, A method for updating Cholesky factorization of a band matrix, A geometric method in nonlinear programming, A dual simplex-type algorithm for the smallest enclosing ball of balls, Theory of generalized discrepancies on a ball of arbitrary finite dimensions and algorithms for finding low-discrepancy point sets, Minimizing Model Fitting Objectives That Contain Spurious Local Minima by Bootstrap Restarting, Block RLS using row Householder reflections, A total least squares method for Toeplitz systems of equations, An implementation of Milstein's method for general bounded diffusions, Stability analysis of the method of seminormal equations for linear least squares problems, Generation of orthogonal rational functions by procedures for structured matrices, On systolic arrays for updating the Cholesky factorization, Round-off error propagation in four generally-applicable, recursive, least-squares estimation schemes, Efficient algorithms for block downdating of least squares solutions, Geometric adaptive Monte Carlo in random environment, Quasi-Newton approaches to interior point methods for quadratic problems, Orthogonal Laurent polynomials on the unit circle and snake-shaped matrix factorizations, A modified layered-step interior-point algorithm for linear programming, Fast Toeplitz orthogonalization, A physical interpretation of factorization and factor modification in structural analysis, A quasi-Newton method with sparse triple factorization for unconstrained minimization, Solving the minimal least squares problem subject to bounds on the variables, A quasi-Newton method with modification of one column per iteration, QR factorization of Toeplitz matrices, An iterative working-set method for large-scale nonconvex quadratic programming, Obtaining simultaneous solutions of linear subsystems of inequalities and duals, Analysis and implementation of a dual algorithm for constrained optimization, On a primal-dual Newton proximal method for convex quadratic programs, A reduced proximal-point homotopy method for large-scale non-convex BQP
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangular factors of modified matrices
- The QR algorithm for real Hessenberg matrices
- Least Squares Computations by Givens Transformations Without Square Roots
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- The least squares problem and pseudo-inverses
- Quasi-Newton Methods for Unconstrained Optimization
