EconPapers    
Economics at your fingertips  
 

The Sparse Principal Component Analysis Problem: Optimality Conditions and Algorithms

Amir Beck () and Yakov Vaisbourd ()
Additional contact information
Amir Beck: Technion
Yakov Vaisbourd: Technion

Journal of Optimization Theory and Applications, 2016, vol. 170, issue 1, No 9, 119-143

Abstract: Abstract Sparse principal component analysis addresses the problem of finding a linear combination of the variables in a given dataset with a sparse coefficients vector that maximizes the variability of the data. This model enhances the ability to interpret the principal components and is applicable in a wide variety of fields including genetics and finance, just to name a few. We suggest a necessary coordinate-wise-based optimality condition and show its superiority over the stationarity-based condition that is commonly used in the literature, which is the basis for many of the algorithms designed to solve the problem. We devise algorithms that are based on the new optimality condition and provide numerical experiments that support our assertion that algorithms, which are guaranteed to converge to stronger optimality conditions, perform better than algorithms that converge to points satisfying weaker optimality conditions.

Keywords: Optimality conditions; Principal component analysis; Sparsity constrained problems; Stationarity; Numerical methods (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-016-0934-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:170:y:2016:i:1:d:10.1007_s10957-016-0934-x

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-016-0934-x

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:joptap:v:170:y:2016:i:1:d:10.1007_s10957-016-0934-x