A note on the computation of an orthonormal basis for the null space of a matrix

DOI10.1007/BF02592223MaRDI QIDQ3326727zbMATH OpenFDO

Authors Thomas F. Coleman, Danny C. Sorensen

Publication date 1984

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

orthonormal basisconstrained optimizationHouseholderQR-decompositionfast Givens

Mathematics Subject Classification ID

Factorization of matrices (15A23) Orthogonalization in numerical linear algebra (65F25)

Recommendations

• Continuity of the null space basis and constrained optimization
• Properties of a representation of a basis for the null space
• An algorithm to compute a sparse basis of the null space
• The Null Space Problem II. Algorithms
• Publication:3468552

Cites work

• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• scientific article; zbMATH DE number 3750156 (Why is no real title available?)
• scientific article; zbMATH DE number 3800875 (Why is no real title available?)
• A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
• A variable projection method for solving separable nonlinear least squares problems
• Analysis of Algorithms for Reflections in Bisectors
• Newton-type methods for unconstrained and linearly constrained optimization
• Nonlinear programming via an exact penalty function: Asymptotic analysis
• Nonlinear programming via an exact penalty function: Global analysis
• Solution of sparse linear least squares problems using Givens rotations

Cited in

(17)

• On the computation of multi-dimensional solution manifolds of parametrized equations
• Some properties of the Hessian of the logarithmic barrier function
• A Bayesian mixed-effects model to learn trajectories of changes from repeated manifold-valued observations
• Continuous decompositions and coalescing eigenvalues for matrices depending on parameters
• Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization
• MANPAK: A set of algorithms for computations on implicitly defined manifolds
• The local convergence of the Byrd-Schnabel algorithm for constrained optimization
• A note on the generation of \(\Delta\)-orthonormal bases
• An algorithm for composite nonsmooth optimization problems
• An exact penalty function for semi-infinite programming
• Solutions to an inverse monic quadratic eigenvalue problem
• Properties of a representation of a basis for the null space
• A Symbolic Approach to Compute a Null-Space Basis in the Projection Method
• An analysis of reduced Hessian methods for constrained optimization
• Continuity of the null space basis and constrained optimization
• A reduced Hessian SQP method for inequality constrained optimization
• Local properties of algorithms for minimizing nonsmooth composite functions

This page was built for publication: A note on the computation of an orthonormal basis for the null space of a matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3326727)