Name
Abstract | ||
|---|---|---|
Given a rectangular matrixA(x) that depends on the independent variablesx, many constrained optimization methods involve computations withZ(x), a matrix whose columns form a basis for the null space ofAT(x). WhenA is evaluated at a given point, it is well known that a suitableZ (satisfyingATZ = 0) can be obtained from standard matrix factorizations. However, Coleman and Sorensen have recently shown that standard orthogonal factorization methods may produce orthogonal bases that do not vary continuously withx; they also suggest several techniques for adapting these schemes so as to ensure continuity ofZ in the neighborhood of a given point. |
Year | DOI | Venue |
|---|---|---|
1985 | 10.1007/BF01582244 | Math. Program. |
Keywords | Field | DocType |
nonlinear optimization,matrix factorization,null-space continuity.,optimization,perturbations,convergence,computations,standardization,variables,constrained optimization,orthogonality | Kernel (linear algebra),Convergence (routing),Discrete mathematics,Mathematical optimization,Matrix (mathematics),Nonlinear programming,Matrix decomposition,Orthogonality,Factorization,Mathematics,Constrained optimization | Journal |
Volume | Issue | ISSN |
33 | 2 | 1436-4646 |
Citations | PageRank | References |
8 | 3.15 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philip E. Gill | 1 | 8 | 3.15 |
| Walter Murray | 2 | 456 | 263.71 |
| Michael A. Saunders | 3 | 1224 | 785.45 |
| G. W. Stewart | 4 | 8 | 3.15 |
| Margaret H. Wright | 5 | 1233 | 182.31 |