A note on fast envelope estimation

R. Dennis Cook, Liliana Forzani, Zhihua Su

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


We propose a new algorithm for envelope estimation, along with a new n-consistent method for computing starting values. The new algorithm, which does not require optimization over a Grassmannian, is shown by simulation to be much faster and typically more accurate than the best existing algorithm proposed by Cook and Zhang (2016).

Original languageEnglish (US)
Pages (from-to)42-54
Number of pages13
JournalJournal of Multivariate Analysis
StatePublished - 2016

Bibliographical note

Funding Information:
The authors thank Hongtu Zhu for providing the Alzheimer data and Nadia L. Kudraszow for providing the glass data. The authors also thank the Editor and two Associate Editors for an incredibly fast review, faster than we have ever experienced before. Research for this article was supported in part by grant DMS-1407460 from the National Science Foundation .

Publisher Copyright:
© 2016 Elsevier Inc.


  • Envelopes
  • Grassmann manifold
  • Reducing subspaces


Dive into the research topics of 'A note on fast envelope estimation'. Together they form a unique fingerprint.

Cite this