IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v383y2020ics0096300320302411.html
   My bibliography  Save this article

tSSNALM: A fast two-stage semi-smooth Newton augmented Lagrangian method for sparse CCA

Author

Listed:
  • Xiu, Xianchao
  • Yang, Ying
  • Kong, Lingchen
  • Liu, Wanquan

Abstract

Canonical correlation analysis (CCA) is a very useful tool for measuring the linear relationship between two multidimensional variables. However, it often fails to extract meaningful features in high-dimensional settings. This motivates the sparse CCA problem, in which ℓ1 constraints are applied to the canonical vectors. Although some sparse CCA solvers exist in the literature, we found that none of them is efficient. We propose a fast two-stage semi-smooth Newton augmented Lagrangian method (tSSNALM) to solve sparse CCA problems, and we provide convergence analysis. Numerical comparisons between our approach and a number of state-of-the-art solvers, on simulated data sets, are presented to demonstrate its efficiency. To the best of our knowledge, this is the first time that duality has been integrated with a semi-smooth Newton method for solving sparse CCA.

Suggested Citation

  • Xiu, Xianchao & Yang, Ying & Kong, Lingchen & Liu, Wanquan, 2020. "tSSNALM: A fast two-stage semi-smooth Newton augmented Lagrangian method for sparse CCA," Applied Mathematics and Computation, Elsevier, vol. 383(C).
    • Handle: RePEc:eee:apmaco:v:383:y:2020:i:c:s0096300320302411
    DOI: 10.1016/j.amc.2020.125272
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320302411
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125272?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Adrian S. Lewis & Jérôme Malick, 2008. "Alternating Projections on Manifolds," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 216-234, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Francisco J. Aragón Artacho & Rubén Campoy, 2018. "A new projection method for finding the closest point in the intersection of convex sets," Computational Optimization and Applications, Springer, vol. 69(1), pages 99-132, January.
    2. Nguyen Hieu Thao, 2018. "A convergent relaxation of the Douglas–Rachford algorithm," Computational Optimization and Applications, Springer, vol. 70(3), pages 841-863, July.
    3. D. Russell Luke & Nguyen H. Thao & Matthew K. Tam, 2018. "Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1143-1176, November.
    4. David Salas & Lionel Thibault, 2019. "On Characterizations of Submanifolds via Smoothness of the Distance Function in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 182(1), pages 189-210, July.
    5. Jean-Baptiste Hiriart-Urruty & Jérôme Malick, 2012. "A Fresh Variational-Analysis Look at the Positive Semidefinite Matrices World," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 551-577, June.
    6. Masaru Ito & Bruno F. Lourenço, 2024. "Eigenvalue programming beyond matrices," Computational Optimization and Applications, Springer, vol. 89(2), pages 361-384, November.
    7. Radu Ioan Bot & Dang-Khoa Nguyen, 2020. "The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 682-712, May.
    8. Peter Ochs, 2018. "Local Convergence of the Heavy-Ball Method and iPiano for Non-convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 153-180, April.
    9. Hédy Attouch & Jérôme Bolte & Patrick Redont & Antoine Soubeyran, 2010. "Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 438-457, May.
    10. Yingnan Wang & Naihua Xiu, 2011. "Strong Semismoothness of Projection onto Slices of Second-Order Cone," Journal of Optimization Theory and Applications, Springer, vol. 150(3), pages 599-614, September.
    11. Xiangfeng Wang & Junping Zhang & Wenxing Zhang, 2020. "The distance between convex sets with Minkowski sum structure: application to collision detection," Computational Optimization and Applications, Springer, vol. 77(2), pages 465-490, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:383:y:2020:i:c:s0096300320302411. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.