Errata for Optimization Algorithms on Matrix Manifolds / Absil, Mahony, and Sepulchre
If you find an error that is not in the list below, please let us know about it.
P.-A. Absil, R. Mahony, & R. Sepulchre
- On page 8, replace the 2nd and 3rd sentences by this: "In view of the properties of matrix trace and inversion, one has the invariance property that for all invertible matrices . Each equivalence class , which gathers all the matrices with the same column space as , contains matrices such that . (Take .) Thus, without loss of generality, we can restrict the search space to matrices such that . Moreover, since is invertible, we can set . Since , the condition is equivalent to ."
- page 25, Proposition 3.3.2: the symbol "" is used to mean two different things. To fix this, replace, e.g., "" by "" in the 3rd line of the proposition.
- page 34, line -11: also require that .
- page 43, line 15: "" should be "".
- page 48, line -3 (last displayed equation of the page): delete the first "".
- page 48, line -1: insert "" after "".
- page 59, two lines below (4.8): replace "" by "".
- page 62, Definition 4.2.1: insert "to " after "gradient-related".
- pages 62-63: in Algorithm 1, without further assumptions, may not exist. In that case, Algorithm 1 produces a finite sequence. This situation is explicitly dismissed in subsequent results that assume an infinite sequence of iterates. Nevertheless, in a practical implementation of Algorithm 1, care must be taken to ensure that the inner iteration that computes terminates. This can be done as follows. In Definition 4.2.2 (Armijo point), insert the assumption that " is a descent direction (i.e., )". In Algorithm 1, as first line in the for loop, insert: "0: If then Break." Still in Algorithm 1, replace line "2:" by this: "2: Pick in by a procedure guaranteeing that (i) and (ii) if the sequence is infinite (i.e., the above Break is never reached) then it is gradient-related to (Definition 4.2.1). (Note that is such a procedure.)"
- page 64: In the proof of Theorem 4.3.1, denotes the Armijo step size computed in Algorithm 1.
- page 64, line -6: insert "in " after "for all ".
- page 65: the "" that appears in (4.15) and on the line above depends on , hence "" is a better notation.
- page 68, line 13: "" should be "".
- page 75, table 4.1: the normal space to should rather be (seeing as its own embedding space).
- page 80, line 4: "(local)" can be deleted.
- page 80, line below (4.32): replace all "" signs by "".
- page 86, Algorithm 3, step 2: "" is missing in .
- page 92, first line below Figure 5.1: replace "" by "".
- page 108, line 5: replace "" by ""
- page 119, line 9: delete the factor "" in the first equation.
- page 123, line -6: "" should be "the orthogonal complement of ".
- page 124, two lines below (6.35): insert "" after "".
- page 130, (6.46): on the right-hand side of the equation, replace "" by "".
- page 143, section 7.3.2, second paragraph, 4th line: insert a minus sign, yielding .
- page 144, Algorithm 10, lines 4, 9, 10: replace "" (but not "") by "".
- page 147, line 6: replace "" by "".
- page 148, line -8: definition of : remove "for all ".
- page 150, line 4: replace "" by "".
- page 152, line -2: replace "minimizing geodesic" by "geodesic in ".
- page 153, second line of the proof of Lemma 7.4.8: replace "" by "".
- page 154, first line of the proof of Lemma 7.4.10: insert "" at the end of the sentence.
- page 164, Algorithm 12, lines 4, 9, and 10: replace by , and replace the Frobenius metric by the nonstandard metric (7.55), i.e., insert in the trace.
- page 171, equation (8.4): replace by (in the middle term).
- page 174, section 8.1.3: replace the two occurences of by .
- page 174: second displayed equation: replace the subscript in the left-hand side by .
- page 174: at the end of the page, add: provided that the right-hand side is a bona-fide horizontal lift. Since horizontality is guaranteed by construction, it remains to require that does not depend on the choice of in the fiber . Equivalently stated, for all real-valued functions on the quotient manifold,
must not depend on the choice of in the fiber .
- page 179, line -15: "for all " should be "for all ".
- page 181, line 6: remove the minus sign in the formula of . (Observe that is defined as .)
- page 185, line -8: replace "" by "".
- page 196, line -4: .