Sciweavers

    260
    Voted
    ORL
    2011
    270views Operations Research» more  ORL 2011»
    Convex approximations to sparse PCA via Lagrangian duality
    15 years 7 days ago
    Convex approximations to sparse PCA via Lagrangian duality
    Download  www.tau.ac.il
    We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
    Ronny Luss, Marc Teboulle
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.