A note on the computation of an orthonormal basis for the null space of a matrix
From MaRDI portal
Publication:3326727
DOI10.1007/BF02592223zbMath0539.65020MaRDI QIDQ3326727
Thomas F. Coleman, Danny C. Sorensen
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Properties of a representation of a basis for the null space, The local convergence of the Byrd-Schnabel algorithm for constrained optimization, Some properties of the Hessian of the logarithmic barrier function, An analysis of reduced Hessian methods for constrained optimization, Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization, Continuity of the null space basis and constrained optimization, On the computation of multi-dimensional solution manifolds of parametrized equations, An exact penalty function for semi-infinite programming, Solutions to an inverse monic quadratic eigenvalue problem, MANPAK: A set of algorithms for computations on implicitly defined manifolds, A reduced Hessian SQP method for inequality constrained optimization, An algorithm for composite nonsmooth optimization problems, Unnamed Item, Continuous Decompositions and Coalescing Eigenvalues for Matrices Depending on Parameters, Local properties of algorithms for minimizing nonsmooth composite functions, A note on the generation of \(\Delta\)-orthonormal bases
Cites Work
- Solution of sparse linear least squares problems using Givens rotations
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- Nonlinear programming via an exact penalty function: Global analysis
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Newton-type methods for unconstrained and linearly constrained optimization
- A variable projection method for solving separable nonlinear least squares problems
- Analysis of Algorithms for Reflections in Bisectors
- Unnamed Item
- Unnamed Item
- Unnamed Item
