Convex approximations to sparse PCA via Lagrangian duality
Year of publication: |
2011
|
---|---|
Authors: | Luss, Ronny ; Teboulle, Marc |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 39.2011, 1, p. 57-61
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Applying a mathematical programming approach for a green product mix decision
Tsai, Wen-hsien, (2012)
-
Optimal decision for warranty with consideration of marketing and production capacity
Yeh, Chun-wu, (2015)
-
Mathematical modelling of a robust inspection process plan : Taguchi and Monte Carlo methods
Mohammadi, Mehrdad, (2015)
- More ...
-
Convex approximations to sparse PCA via Lagrangian duality
Luss, Ronny, (2011)
-
A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
Beck, Amir, (2012)
-
A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
Drori, Yoel, (2015)
- More ...